Result: Accepted
Time: 13ms
Memory: 1092kB
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct student
{
char ch[20];
int score[2];
int total;
};
int comp(const void*p,const void *q){
return ((struct student *)q)->total-((struct student *)p)->total;
}
int main()
{
struct student f[100];
int T,i,N,j;
scanf("%d",&T);
for(j=0;j<T;++j)
{
scanf("%d",&N);
for(i=0;i<N;++i)
{
scanf("%s %d %d",f[i].ch,&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].ch);
}
}
return 0;
}