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