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