Result: Accepted
Time: 12ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
struct student
{
char name[31];
int llcj;
int sjcj;
int zf;
};
int comp(const void *p,const void *q)
{
return((struct student *)q)->zf-((struct student *)p)->zf;
}
int main()
{
struct student studentArray[105];
int T,N,i;
scanf("%d",&T);
while(T--)
{
scanf("%d",&N);
getchar();
for(i=0;i<N;i++)
{
scanf("%s %d %d",&studentArray[i].name,&studentArray[i].llcj,&studentArray[i].sjcj);
}
for(i=0;i<N;i++)
{
studentArray[i].zf=studentArray[i].llcj+studentArray[i].sjcj;
}
qsort(studentArray,N,sizeof(struct student),comp);
for(i=0;i<N;i++)
{
printf("%s\n",studentArray[i].name);
}
}
return 0;
}