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