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