题目

宋代史学家司马光在《资治通鉴》中有一段著名的“德才论”：“是故才德全尽谓之圣人，才德兼亡谓之愚人，德胜才谓之君子，才胜德谓之小人。凡取人之术，苟不得圣人，君子而与之，与其得小人，不若得愚人。”

现给出一批考生的德才分数，请根据司马光的理论给出录取排名。

输入格式：

输入第1行给出3个正整数，分别为：N（<=10⁵），即考生总数；L（>=60），为录取最低分数线，即德分和才分均不低于L的考生才有资格被考虑录取；H（<100），为优先录取线——德分和才分均不低于此线的被定义为“才德全尽”，此类考生按德才总分从高到低排序；才分不到但德分到线的一类考生属于“德胜才”，也按总分排序，但排在第一类考生之后；德才分均低于H，但是德分不低于才分的考生属于“才德兼亡”但尚有“德胜才”者，按总分排序，但排在第二类考生之后；其他达到最低线L的考生也按总分排序，但排在第三类考生之后。

随后N行，每行给出一位考生的信息，包括：准考证号、德分、才分，其中准考证号为8位整数，德才分为区间[0, 100]内的整数。数字间以空格分隔。

输出格式：

输出第1行首先给出达到最低分数线的考生人数M，随后M行，每行按照输入格式输出一位考生的信息，考生按输入中说明的规则从高到低排序。当某类考生中有多人总分相同时，按其德分降序排列；若德分也并列，则按准考证号的升序输出。

输入样例：

14 60 80
10000001 64 90
10000002 90 60
10000011 85 80
10000003 85 80
10000004 80 85
10000005 82 77
10000006 83 76
10000007 90 78
10000008 75 79
10000009 59 90
10000010 88 45
10000012 80 100
10000013 90 99
10000014 66 60

输出样例：

12
10000013 90 99
10000012 80 100
10000003 85 80
10000011 85 80
10000004 80 85
10000007 90 78
10000006 83 76
10000005 82 77
10000002 90 60
10000014 66 60
10000008 75 79
10000001 64 90

我的解决方案

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

typedef struct {
    int num;
    int morality;
    int possibility;
    int sumOfGrade;
} Student;

//初始化数组
void initStudents(Student **students, size_t size)
{
    *students = malloc(sizeof(Student) * size);
    memset(*students, 0, sizeof(Student) * size);
}

//设置学生属性
void setAttribute(Student *student, int num, int morality, int possibility)
{ 
    student->num = num;
    student->morality = morality;
    student->possibility = possibility;
    student->sumOfGrade = student->morality + student->possibility;
}

//输出students
void printStudents(Student *students, int size)
{
    for (int i = 0; i < size; ++i) {
        printf("%d %d %d\n", students[i].num, 
                students[i].morality, students[i].possibility);
    }
}

// 按总成绩降序排序，若总成绩相等，按德分降序，若德分相等，按学号升序
int cmp(const void *student1, const void *student2)
{
    Student *first = (Student *)student1;
    Student *second = (Student *)student2;

    if (first->sumOfGrade != second->sumOfGrade) {
        return second->sumOfGrade - first->sumOfGrade;
    }
    else if (first->morality != second->morality) {
        return second->morality - first->morality;
    }
    else {
        return first->num - second->num;
    }
}

int main(void)
{
    int n, l, h; //n:考生数; l:录取最低分数线; h:优先录取线
    int num, morality, possibility;
    int size1 = 0, size2 = 0, size3 = 0, size4 = 0;
    Student *students1, *students2, *students3, *students4;

    scanf("%d%d%d", &n, &l, &h);
    initStudents(&students1, n);
    initStudents(&students2, n);
    initStudents(&students3, n);
    initStudents(&students4, n);

    //输入学生数据，并分类
    for (int i = 0; i < n; ++i) {
        scanf("%d%d%d", &num, &morality, &possibility);
        if (morality < l || possibility < l) {
            continue;
        }
        if (morality >= h && possibility >= h) {
            setAttribute(students1 + size1++, num, morality, possibility);
        }
        else if (morality >= h) {
            setAttribute(students2 + size2++, num, morality, possibility);
        }
        else if (morality >= possibility) {
            setAttribute(students3 + size3++, num, morality, possibility);
        }
        else {
            setAttribute(students4 + size4++, num, morality, possibility);
        }
    }

    //排序
    qsort(students1, size1, sizeof(Student), cmp);
    qsort(students2, size2, sizeof(Student), cmp);
    qsort(students3, size3, sizeof(Student), cmp);
    qsort(students4, size4, sizeof(Student), cmp);

    //输出结果
    printf("%d\n", size1 + size2 + size3 + size4);
    printStudents(students1, size1);
    printStudents(students2, size2);
    printStudents(students3, size3);
    printStudents(students4, size4);

    return 0;
}