Result: Accepted
Time: 4ms
Memory: 1796kB
#include<stdio.h>
#include<stdlib.h>
#define array_size 200
struct namenumber{
char name[50];
int number[1000];
};
int comp(const void*p,const void*q){
return ((struct namenumber*)q)->number[0]-((struct namenumber*)p)->number[0];
}
int main ()
{
struct namenumber chok[array_size];
int t,n,i;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;++i)
{
scanf("%s %d",chok[i].name,&chok[i].number[0]);
}
qsort(chok,n,sizeof(struct namenumber),comp);
for(i=0;i<n;++i)
{
printf("%s\n",chok[i].name);
}
}
return 0;
}