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