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