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