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