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