C++ :

#include <bits/stdc++.h>
using namespace std;
struct node{
	int x;
	int y;
}a[10010];

//排序：先按x升序，x相同按y升序 
bool cmp1(node a,node b){
	if(a.x > b.x) return a.x < b.x?true:false;
	if(a.x == b.x && a.y > b.y) return a.y < b.y?true:false; 
}

int main(){
	int n,i;
	cin>>n;
	for(i = 0;i < n;i++){
		cin>>a[i].x>>a[i].y;
	}
	
	sort(a,a+n,cmp1);
	
	for(i = 0;i < n;i++){
		cout<<a[i].x<<" "<<a[i].y<<endl; 
	}
}

Python :

 
zbs = []
class Zb:
    def __init__(self,x,y):
        self.x = x
        self.y= y

n=int(input())
for i in range(n):
  x,y=list(map(int,input().split()))
  zbs.append(Zb(x,y))

 

zbslist = sorted(zbs, key=lambda zz:(zz.x, zz.y))

 

for t in zbslist:
    print(t.x,t.y)