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