1015. 德才论 (25)

题目来源:http://www.patest.cn/contests/pat-b-practise/1015

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

typedef struct student {
    int id;
    int virtue;
    int intellect;
    int stage;
} student;

int cmp (const void*, const void*);

int main() {
    student list[100001];
    int n = 0, i = 0, H = 0, L = 0;
    scanf("%d %d %d", &n, &L, &H);
    for (i = 0; i < n; i++) {
        scanf("%d %d %d", &list[i].id, &list[i].virtue, &list[i].intellect);
        if (list[i].virtue < L || list[i].intellect < L) {
            i--;
            n--;
            continue;
        } else if (list[i].virtue >= H && list[i].intellect >= H) {
            list[i].stage = 1;
        } else if (list[i].virtue >= H && list[i].intellect < H) {
            list[i].stage = 2;
        } else if (list[i].virtue < H && list[i].intellect < H && list[i].virtue >= list[i].intellect) {
            list[i].stage = 3;
        } else {
            list[i].stage = 4;
        }
    }

    qsort(list, n, sizeof(student), cmp);// 待排序最多100000个，防止超时，用快排
    printf("%d\n", n);
    for (i = 0; i < n; i++)
        printf("%d %d %d\n", list[i].id, list[i].virtue, list[i].intellect);
    return 0;
}

int cmp (const void* a, const void* b) {//关键在于排序，照着题意写就好了
    if (((*(student*)a)).stage < ((*(student*)b)).stage)
        return -1;
    else if (((*(student*)a)).stage > ((*(student*)b)).stage)
        return 1;
    else if (((*(student*)a)).stage == ((*(student*)b)).stage) {
        if (((*(student*)a)).virtue + ((*(student*)a)).intellect > ((*(student*)b)).virtue + ((*(student*)b)).intellect)
            return -1;
        else if (((*(student*)a)).virtue + ((*(student*)a)).intellect < ((*(student*)b)).virtue + ((*(student*)b)).intellect)
            return 1;
        else if (((*(student*)a)).virtue + ((*(student*)a)).intellect == ((*(student*)b)).virtue + ((*(student*)b)).intellect) {
            if (((*(student*)a)).virtue > ((*(student*)b)).virtue)
                return -1;
            else if (((*(student*)a)).virtue < ((*(student*)b)).virtue)
                return 1;
            else if (((*(student*)a)).virtue == ((*(student*)b)).virtue)
                return ((*(student*)a)).id - ((*(student*)b)).id;
        }
    }
}