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