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 (≤), 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<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

int Rank[1000000][4] = { 0 };//排序数列，id为下标，内容为ACME的四项排名，根据A > C > M > E最好设成这个顺序
int now;
struct node {
    int id;
    int grade[4];    //存放4个分数
}stu[2000];

//排序函数
bool cmp(node a, node b) {
    return a.grade[now] > b.grade[now];
}

int main()
{
    int n, m;
    char str[10] = {'A','C','M','E'};
    cin>>n>>m;
    for (int i = 0; i < n; i++) {
        cin>>stu[i].id>>stu[i].grade[1]>>stu[i].grade[2]>>stu[i].grade[3];
        stu[i].grade[0] = stu[i].grade[1] + stu[i].grade[2] + stu[i].grade[3];
    }

    for (now = 0; now < 4; now++) {//排序成绩
        sort(stu, stu + n, cmp);
        Rank[stu[0].id][now] = 1;//stu根据对应分数排序
        for (int i = 1; i < n; i++) {
            if (stu[i].grade[now] != stu[i - 1].grade[now]) Rank[stu[i].id][now] = i + 1;
            else Rank[stu[i].id][now] = Rank[stu[i - 1].id][now];
        }
    }
    while(m--){
        int temp_id;
        cin>>temp_id;
        if (Rank[temp_id][0] == 0) {
            cout<<"N/A"<<endl;
            continue;
        }
        int best_sub = 0, temp_grade = Rank[temp_id][0];
        for (int j = 1; j < 4; j++) {
            if (Rank[temp_id][j] < temp_grade) {
                best_sub = j;
                temp_grade = Rank[temp_id][j];
            }
        }
        cout<<temp_grade<<" "<<str[best_sub]<<endl;
    }
    return 0;
}

 

转载于:https://www.cnblogs.com/TBhacker/p/11299332.html