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