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