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