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