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