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