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