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