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