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