PAT Advanced 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.

Sample Input:

5 6
310101 98 85 88
310102 70 95 88
310103 82 87 94
310104 91 91 91
310105 85 90 90
310101
310102
310103
310104
310105
999999

Sample Output:

1 C
1 M
1 E
1 A
3 A
N/A.

算法描述：模拟排序

#include<iostream>
#include<algorithm>
using namespace std;

const int N = 2020;
int n, m;
int exist[1000000], flag = -1;

struct st
{
    int id, best;
    int sc[4], rank[4];
    char course;
}s[N];

bool cmp(st a, st b)    {   return a.sc[flag] > b.sc[flag]; }

int main()
{
    cin >> n >> m;
    for(int i = 0 ; i < n ; i ++)
    {
        cin >> s[i].id >> s[i].sc[1] >> s[i].sc[2] >> s[i].sc[3];
        s[i].sc[0] = (s[i].sc[1] + s[i].sc[2] + s[i].sc[3]) / 3.0 + 0.5;
    }
    //给每门课排名
    for(flag = 0 ; flag <= 3 ; flag ++)
    {
        sort(s, s + n, cmp);
        s[0].rank[flag] = 1;
        for(int i = 1 ; i < n ; i ++)
        {
            s[i].rank[flag] = i + 1;
            //特判并列的排名
            if(s[i].sc[flag] == s[i-1].sc[flag])
                s[i].rank[flag] = s[i-1].rank[flag];
        }
    }
    //选出排名最好的科目
    for(int i = 0 ; i < n ; i ++)
    {
        exist[s[i].id] = i + 1; // 存在则不为0
        s[i].best = 0;
        int min_ = s[i].rank[0]; //排名  越小越好
        for(int j = 1 ; j <= 3 ; j ++)
        {
            //如果当前第i个学生的第j门课排名更高  则更新i同学的最好排名
            if(s[i].rank[j] < min_)
            {
                min_ = s[i].rank[j];
                s[i].best = j;  //记下最好排名的科目下标
            }
        }
    }
    
    char c[5] = {'A', 'C', 'M', 'E'};
    while(m --)
    {
        int id;
        cin >> id;
        int t = exist[id]; //记录学号是否存在
        if(t)
        {
            int best = s[t - 1].best;
            cout << s[t - 1].rank[best] << ' ' << c[best] << endl;
        }
        else
            cout << "N/A" << endl;
    }
    
    return 0;
}