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