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