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