Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- int n;
- int num[1000001][2],ans[1000001][2],maxA;
- int savem=0,tempm=0,savex=0;
- int i;
- int sort_function(const void *a,const void *b)
- {
- int *aa = (int *)a;
- int *bb = (int *)b;
- if(aa[0]<bb[0]) return 1;
- else if(aa[0] == bb[0] && aa[1] > bb[1]) return 1;
- else return -1;
- }
- int sort_function2(const void *a,const void *b)
- {
- int *aa = (int *)a;
- int *bb = (int *)b;
- if(aa[0]>bb[0]) return 1;
- else if(aa[0] == bb[0] && aa[1] < bb[1]) return 1;
- else return -1;
- }
- int main()
- {
- scanf("%d",&n);
- for(i=0;i<n;i++) scanf("%d %d",&num[i][0],&num[i][1]);
- qsort(num,n,sizeof(num[0]),sort_function);
- for(i=0;i<n;i++)
- {
- if(num[i][1] >= savem)
- {
- ans[maxA][0] = num[i][0];
- ans[maxA][1] = num[i][1];
- if(savem<num[i][1]) savem = num[i][1];
- maxA++;
- }
- }
- qsort(ans,maxA,sizeof(ans[0]),sort_function2);
- for(i=0;i<maxA;i++) printf("%d %d\n",ans[i][0],ans[i][1]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement