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