Result: Accepted
Time: 16ms
Memory: 1092kB
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
struct stu{
char name[31];
int a;
int b;
int sum;
};
int cmp( const void *a,const void *b){
return ((struct stu *)b)->sum - ((struct stu *)a)->sum;
}
int main()
{
int T, n, i;
struct stu stud[101];
scanf("%d",&T);
while (T--){
scanf("%d",&n);
for ( i = 0;i < n;i++ ){
scanf("%s %d %d",stud[i].name,&stud[i].a,&stud[i].b);
stud[i].sum = stud[i].a + stud[i].b;
}
qsort( stud,n,sizeof(struct stu),cmp );
for ( i = 0;i < n;i++ ){
printf("%s\n",stud[i].name);
}
}
return 0;
}