Result: Accepted
Time: 12ms
Memory: 1092kB
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct student
{
char name[20];
int k1;
int k2;
int zong;
};
int comp(const void *p,const void *q)
{
return((struct student * )q)->zong -((struct student * )p)->zong;
}
int main()
{
struct student quanbu[100];
int i,t,n;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;++i)
{
scanf("%s%d%d",quanbu[i].name,&quanbu[i].k1,&quanbu[i].k2);
quanbu[i].zong=quanbu[i].k1+quanbu[i].k2;
}
qsort(quanbu,n,sizeof(struct student),comp);
for(i=0;i<n;++i){
printf("%s\n",quanbu[i].name);}
}
}