Result: Accepted
Time: 10ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
struct student
{
char name[30];
int ll,sj;
int sum;
};
int comp(const void *p,const void *q)
{
return ((struct student *)q)->sum-((struct student *)p)->sum;
}
int main()
{
struct student studentarray[100];
int t;
int n;
int i;
int j,k;
char *temp;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s%d%d",studentarray[i].name,&studentarray[i].ll,&studentarray[i].sj);
studentarray[i].sum=studentarray[i].ll+studentarray[i].sj;
}
qsort(studentarray,n,sizeof(struct student),comp);
for(i=0;i<n;i++)
printf("%s\n",studentarray[i].name);
}
return 0;
}