Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
- typedef struct{
- int id;
- int max;
- }SOROZAT;
- int rendez(const void *a, const void *b){
- SOROZAT *pa = (SOROZAT*)a;
- SOROZAT *pb = (SOROZAT*)b;
- if(pa->max<pb->max)
- return -1;
- else if(pa->max>pb->max)
- return 1;
- else if(pa->id<pb->id)
- return -1;
- else if(pa->id>pb->id)
- return 1;
- }
- int main(){
- int db=0,n,i;
- int t[50];
- SOROZAT s[60];
- while(scanf("%d", &n)!=EOF){
- if(db==50)
- break;
- for(i=0;i<n;i++){
- scanf("%d", &t[i]);
- if(t[i]>s[db].max || i==0)
- s[db].max=t[i];
- }
- s[db].id=db+1;
- db++;
- }
- qsort(s,db,sizeof(SOROZAT),rendez);
- for(i=0;i<db;i++){
- printf("%d",s[i].id);
- if(i!=db-1)
- putchar(' ');
- }
- puts("");
- return EXIT_SUCCESS;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement