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