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