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