题解 | 成绩排序

#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>

typedef struct student
{
    char name[21];
    int score;
}tpyStudent;

int inc(const void* a, const void* b)
{
    int result=((tpyStudent*)a)->score-((tpyStudent*)b)->score;

    return result;
}

int dcs(const void* a,const void* b)
{
    int result=((tpyStudent*)b)->score-((tpyStudent*)a)->score;

    return result;
}

int main() {
    int n,dir;

    scanf("%d",&n);
    scanf("%d",&dir);

    tpyStudent usrStudent[n];

    for(int i=0;i<n;i++)
    {
        scanf("%s %d",usrStudent[i].name,&(usrStudent[i].score));
    }

    if(dir)
        qsort(usrStudent,n,sizeof(tpyStudent),inc);
    else
        qsort(usrStudent,n,sizeof(tpyStudent),dcs);

    for(int i=0;i<n;i++)
    {
        printf("%s %d\r\n",usrStudent[i].name,usrStudent[i].score);
    }
    
    return 0;
}