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