Result: Accepted
Time: 11ms
Memory: 1096kB
#include"stdio.h"
typedef struct{char name[35];int test1,test2;int test;}STU;
STU s[105];
int cmp(const void *a,const void *b){
STU *c=(STU*)a,*d=(STU*)b;
return (d->test)-(c->test);
}
int main(){
int T,n;
int i;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&s[i].name);
scanf("%d",&s[i].test1);
scanf("%d",&s[i].test2);
s[i].test=s[i].test1+s[i].test2;
}
qsort(s,n,sizeof(s[0]),cmp);
for(i=0;i<n;i++){
printf("%s\n",s[i].name);
}
}
return 0;
}