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