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