Result: Accepted
Time: 12ms
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 x[110];
int n, i, t;
scanf("%d", &t);
while(t--) {
scanf("%d", &n);
for(i=0;i<n;i++) {
scanf("%s%d%d", x[i].s, &x[i].a, &x[i].b);
x[i].total=x[i].a+x[i].b;
}
qsort(x,n,sizeof(struct student),comp);
for(i=0;i<n;i++) {
printf("%s\n", x[i].s);
}
}
return 0;
}