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