Result: Accepted
Time: 4ms
Memory: 1120kB
#include<stdio.h>
#include<stdlib.h>
#define ARRAY_SIZE 100
struct student
{
char name[21];
int cishu;
};
int comp(const void *p,const void *q)
{
return ((struct student *)q)->cishu - ((struct student *)p)->cishu;
}
int main()
{
int T, t;
int ah[51], bh[51],ch[51]={0};
int i, j;
struct student studentArray[ARRAY_SIZE];
struct student paixu;
scanf("%d", &T);
while(T--)
{
scanf("%d", &t);
for(i=0;i<t;i++)
{
scanf("%s %d",studentArray[i].name,&studentArray[i].cishu);
}
qsort(studentArray,t,sizeof(struct student),comp);
for(i=0;i<t;i++)
{
printf("%s\n",studentArray[i].name);
}
}
}