Result: Accepted
Time: 10ms
Memory: 1092kB
#include <stdio.h>
#include <stdlib.h>
struct stu{
char a[30];
int b;
int c;
int tot;
};
int cmp(const void *p,const void *q){
return ((struct stu*)q)->tot - ((struct stu*)p)->tot;
}
int main(){
struct stu num[100];
int t,n,i,j;
scanf("%d",&t);
getchar();
while(t--)
{
scanf("%d",&n);
for(i=0;i<=n-1;i++){
scanf("%s %d %d",&num[i].a,&num[i].b,&num[i].c);
num[i].tot=num[i].b+num[i].c;
}
qsort(num,n,sizeof(struct stu),cmp);
for(i=0;i<=n-1;i++){
printf("%s\n",num[i].a);
}
}
return 0;
}