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