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