Result: Accepted
Time: 11ms
Memory: 1092kB
#include <stdio.h>
#include <stdlib.h>
struct sb{
char ss[35];
int x,y;
int m;
};
int comp(const void * p,const void * q){
return ((struct sb * )q)->m-((struct sb * )p)->m;}
int main(){
struct sb ppp[1000];
int t,n,i;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d",ppp[i].ss,&ppp[i].x,&ppp[i].y);
ppp[i].m=ppp[i].x+ppp[i].y;
}
qsort(ppp,n,sizeof(struct sb),comp);
for(i=0;i<n;i++){
printf("%s\n",ppp[i].ss);
}
}
return 0;
}