#include <iostream> #include <cstdio> #include <math.h> #include <algorithm> #include <istream> #include <string> #include <queue> #include <deque> #include <random> #include <stack> #include <set> #include <string.h> #include <map> #include <unordered_map> #include <sstream> #include <bitset> #include <fstream> #include <climits> #include <time.h> #include <cassert> using namespace std; #define int long long #define double long double #define endl "\n" #define pii pair<int,int> #define p1(x) ((x).first) #define p2(x) ((x).second) int n; struct node{int x,y;}T[50300]; inline int MAN(node A,node B){ return abs(A.x-B.x)+(A.y-B.y); } inline bool cmpru(int x,int y){ node A=T[x],B=T[y]; return A.x==B.x?A.y>B.y:A.x>B.x; } inline bool cmprd(int x,int y){ node A=T[x],B=T[y]; return A.x==B.x?A.y<B.y:A.x>B.x; } inline bool cmplu(int x,int y){ node A=T[x],B=T[y]; return A.x==B.x?A.y>B.y:A.x<B.x; } inline bool cmpld(int x,int y){ node A=T[x],B=T[y]; return A.x==B.x?A.y<B.y:A.x<B.x; } int p[50030]; pii tl[1000300],tr[1000300]; inline int lb(int x){ return x&-x; } inline void modl(int x,pii k){ while(x<=1000001){ tl[x]=min(tl[x],k); x+=lb(x); } } inline void clrl(){ memset(tl,0x3f,sizeof(tl)); } inline pii gl(int x){ pii res={1e9,0}; while(x){ res=min(res,tl[x]); x-=lb(x); } return res; } inline void modr(int x,pii k){ while(x){ tl[x]=min(tl[x],k); x-=lb(x); } } inline void clrr(){ memset(tr,0x3f,sizeof(tr)); } inline pii gr(int x){ pii res={1e9,0}; while(x<=1000001){ res=min(res,tl[x]); x+=lb(x); } return res; } int A1[50010],A2[50030],A3[50030],A4[50030]; signed main(){ ios::sync_with_stdio(0); cin.tie(0),cout.tie(0); cin>>n; for(int i=1;i<=n;i ++) cin>>A[i].x>>A[i].y,p[i]=i; sort(p+1,p+n+1,cmpru); clrr(); for(int i=1;i<=n;i++){ } cout.flush(); return 0; } /* */