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