1080. Graduate Admission (30)解题报告

最新推荐文章于 2020-01-18 00:09:54 发布

信道者

最新推荐文章于 2020-01-18 00:09:54 发布

阅读量743

点赞数

分类专栏： PAT 文章标签： PAT C++

本文链接：https://blog.csdn.net/chr1991/article/details/53053440

版权

PAT 专栏收录该内容

173 篇文章 6 订阅

订阅专栏

#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
using namespace std;

const int K = 5;
struct student {
    int no, rank, ge, gi, app[K];
};
struct school {
    int q;
    vector<int> v;
};

int comp(const void *v1, const void *v2) {
    int flag;
    student s1, s2;
    s1 = *((student *)v1);
    s2 = *((student *)v2);
    if (s1.ge + s1.gi > s2.ge + s2.gi) {
        flag = -1;
    }
    else if (s1.ge + s1.gi < s2.ge + s2.gi) {
        flag = 1;
    }
    else {
        if (s1.ge > s2.ge) {
            flag = -1;
        }
        else if (s1.ge < s2.ge) {
            flag = 1;
        }
        else {
            flag = 0;
        }
    }
    return flag;
}
bool cmp(student s1, student s2) {
    if (s1.rank == s2.rank) {
        return true;
    }
    else {
        return false;
    }
}

int main(void) {
    int n, m, k, i, j;
    student *st;
    school *sc;
    scanf("%d %d %d", &n, &m, &k);
    st = new student[n];
    sc = new school[m];
    for (i = 0; i < m; i++) {
        scanf("%d", &sc[i].q);
    }
    for (i = 0; i < n; i++) {
        st[i].no = i;
        scanf("%d %d", &st[i].ge, &st[i].gi);
        for (j = 0; j < k; j++) {
            scanf("%d", &st[i].app[j]);
        }
    }
    qsort(st, n, sizeof(student), comp);
    int rank = 0;
    st[0].rank = rank;
    for (i = 1; i < n; i++) {
        if (st[i].ge + st[i].gi < st[i - 1].ge + st[i - 1].gi) {
            rank++;
            st[i].rank = rank;
        }
        else if (st[i].ge < st[i - 1].ge) {
            rank++;
            st[i].rank = rank;
        }
        else {
            st[i].rank = rank;
        }
    }
    for (i = 0; i < n; i++) {
        for (j = 0; j < k; j++) {
            if (sc[st[i].app[j]].v.size() > 0 && cmp(st[i], st[sc[st[i].app[j]].v.back()])) {
                sc[st[i].app[j]].v.push_back(i);
                break;
            }
            else if (sc[st[i].app[j]].v.size() < sc[st[i].app[j]].q) {
                sc[st[i].app[j]].v.push_back(i);
                break;
            }
        }
    }
    for (i = 0; i < m; i++) {
        if (sc[i].v.size()) {
            for (j = 0; j < sc[i].v.size(); j++) {
                sc[i].v[j] = st[sc[i].v[j]].no;
            }
            sort(sc[i].v.begin(), sc[i].v.end());
            printf("%d", sc[i].v[0]);
            for (j = 1; j < sc[i].v.size(); j++) {
                printf(" %d", sc[i].v[j]);
            }
        }
        putchar('\n');
    }
    return 0;
}