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