Result: Accepted
Time: 10ms
Memory: 1092kB
#include <stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
struct st{
char name[25];
int li,shi,sum;
};
int comp(const void*p,const void *q){
return ((struct st*)q)->sum-((struct st*)p)->sum;
}
int main()
{ struct st bi[105];
int t,n,i,temp,j,k;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d",bi[i].name,&bi[i].li,&bi[i].shi);
bi[i].sum=bi[i].li+bi[i].shi;
}
qsort(bi,n,sizeof(bi[0]),comp);
for(i=0;i<n;i++)
printf("%s\n",bi[i].name);
}return 0;
}