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