Result: Accepted
Time: 13ms
Memory: 1092kB
#include<stdio.h>
int main(){
int T,i,n,j;
struct student{
char a[100];
int b;
int c;
int d;
}student[100],student1;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",&student[i].a);
scanf("%d%d",&student[i].b,&student[i].c);
student[i].d=student[i].b+student[i].c;
}
for(i=0;i<n;i++){
for(j=0;j<n-i-1;j++)
if(student[j].d<student[j+1].d){
student1=student[j];
student[j]=student[j+1];
student[j+1]=student1;
}
}
for(i=0;i<n;i++){
printf("%s\n",student[i].a);
}
}
return 0;
}