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