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