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