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