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