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