Result: Accepted
Time: 12ms
Memory: 1092kB
#include <stdio.h>
#include<stdlib.h>
struct st
{
char name[22];
int m,n;
int sum;
};
int comp(const void * p,const void * q)
{
return ((struct st * )q)->sum-((struct st *)p)->sum;
}
int main (void)
{
struct st a[101];
int i,n,j,k,t,x;
char b[22];
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;++i)
{
scanf("%s %d %d",a[i].name,&a[i].m,&a[i].n);
a[i].sum=a[i].m+a[i].n;
}
qsort(a,n,sizeof(struct st),comp);
for(i=0;i<n;++i)
{
printf("%s",a[i].name);
printf("\n");
}
}
return 0;
}