Result: Accepted
Time: 16ms
Memory: 1096kB
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct acm{
int s;
char name[33];
int l;
int total;
}student[103];
int comp(const void *p,const void *q){
return ((struct acm *)q)->total-((struct acm *)p)->total;
}
int main(){
int T;
scanf("%d",&T);
while(T--){
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s",student[i].name);
scanf("%d %d",&student[i].s,&student[i].l);
student[i].total=student[i].l+student[i].s;
}
qsort(student,n,sizeof(struct acm),comp);
for(int j=0;j<n;j++){
printf("%s\n",student[j].name);
}
}
}