Result: Accepted
Time: 3ms
Memory: 1120kB
#include<stdio.h>
#include<stdlib.h>
struct student {
char name[21];
int time;
};
int comp(const void*p,const void*q){
return ((struct student*)q)->time-((struct student*)p)->time;
}
int main(void){
struct student studentarray[50];
int t,i,n;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=0;i<n;++i){
scanf("%s %d",studentarray[i].name,&studentarray[i].time);
}
qsort(studentarray,n,sizeof(struct student),comp);
for(i=0;i<n;++i){
printf("%s\n",studentarray[i].name);
}
}
return 0;
}