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