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