PAT-甲级 1012 The Best Rank (25分)【排序】

1012 The Best Rank (25分)

To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algrbra), and E - English. At the mean time, we encourage students by emphasizing on their best ranks -- that is, among the four ranks with respect to the three courses and the average grade, we print the best rank for each student.

For example, The grades of C, M, E and A - Average of 4 students are given as the following:

StudentID  C  M  E  A
310101     98 85 88 90
310102     70 95 88 84
310103     82 87 94 88
310104     91 91 91 91

Then the best ranks for all the students are No.1 since the 1st one has done the best in C Programming Language, while the 2nd one in Mathematics, the 3rd one in English, and the last one in average.

Input Specification:

Each input file contains one test case. Each case starts with a line containing 2 numbers N and M (≤2000), which are the total number of students, and the number of students who would check their ranks, respectively. Then N lines follow, each contains a student ID which is a string of 6 digits, followed by the three integer grades (in the range of [0, 100]) of that student in the order of C, M and E. Then there are M lines, each containing a student ID.

Output Specification:

For each of the M students, print in one line the best rank for him/her, and the symbol of the corresponding rank, separated by a space.

The priorities of the ranking methods are ordered as A > C > M > E. Hence if there are two or more ways for a student to obtain the same best rank, output the one with the highest priority.

If a student is not on the grading list, simply output N/A.

题意：N个考生，M次查询
有3门课C，M，E，平均分A
这4个成绩，每项成绩对N个考生从高到低排序，这样对每个考生来说就会有4个排名。
接下来是M次查询，每个查询输入一个考生ID，输出该考生的四个排名中最高的那个排名，及对应的科目是C,M,E,A中的哪一个
如果对不同课程有相同排名的情况，则按优先级A>C>M>E输出，如果查询的学生的ID不存在，则输出N/A（https://blog.csdn.net/mayuejike/article/details/86560308）

注意点：当有两个第一名的时候，分数第二的那个人名次是第三。 

#include <bits/stdc++.h>
using namespace std;
struct node
{
    int id;
    int score[4];
} per[2005];
int cur;
int cmp(node a, node b)
{
    return a.score[cur] > b.score[cur];
}
int main()
{
    int n, m;
    scanf("%d%d", &n, &m);

    for (int i = 0; i < n; i++)
    {
        int t;
        double aver = 0;
        scanf("%d", &per[i].id);
        for (int j = 1; j <= 3; j++)
        {
            scanf("%d", &per[i].score[j]);
            aver += per[i].score[j];
        }
        per[i].score[0] = round(aver / 3); //round()四舍五入函数
    }
    unordered_map<int, int> ma[4];
    for (cur = 0; cur < 4; cur++) //对每项成绩进行排名
    {
        sort(per, per + n, cmp);
        ma[cur][per[0].id] = 1;
        for (int j = 1; j < n; j++)
        {
            if (per[j].score[cur] == per[j - 1].score[cur])
                ma[cur][per[j].id] = ma[cur][per[j - 1].id];
            else
                ma[cur][per[j].id] = j + 1; //注意：这里不能是ma[cur][per[j - 1].id] + 1
        }
    }
    int id;
    char ch[] = {'A', 'C', 'M', 'E'}; //因为优先级A>C>M>E，所以就从A 到 E逐个比较
    while (m--)
    {
        scanf("%d", &id);
        if (ma[0][id] == 0)
        {
            printf("N/A\n");
            continue;
        }
        int a, b;
        a = ma[0][id]; //选出这位学生最靠前的排名
        b = 0;
        for (int i = 1; i <= 3; i++)
        {
            if (ma[i][id] < a)
            {
                a = ma[i][id];
                b = i;
            }
        }
        printf("%d %c\n", a, ch[b]);
    }
}