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