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