PAT 1012 The Best Rank（结构体排序）

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.

排序模拟，注意不要爆栈，考虑到并列的情况。

改了好久的bug，脑壳疼，代码如下：

#include<iostream>
using namespace std;
struct student{
    string ID;
    int point_A;
    int rank_A;
    int point_C;
    int rank_C;
    int point_M;
    int rank_M;
    int point_E;
    int rank_E;
}students[2000];
int main()
{
    int N,M;
    cin>>N>>M;
    for(int i=0;i<N;i++){
        cin>>students[i].ID;
        cin>>students[i].point_C;
        cin>>students[i].point_M;
        cin>>students[i].point_E;
        students[i].point_A=(students[i].point_C+students[i].point_E+students[i].point_M)/3;
    }
    for(int i=0;i<N;i++){
        int ranking=1;
        for(int k=0;k<N;k++)
            if(students[i].point_A<students[k].point_A)
                ranking++;
        students[i].rank_A=ranking;
        ranking=1;
        for(int k=0;k<N;k++)
            if(students[i].point_C<students[k].point_C)
                ranking++;
        students[i].rank_C=ranking;
        ranking=1;
        for(int k=0;k<N;k++)
            if(students[i].point_M<students[k].point_M)
                ranking++;
        students[i].rank_M=ranking;
        ranking=1;
        for(int k=0;k<N;k++)
            if(students[i].point_E<students[k].point_E)
                ranking++;
        students[i].rank_E=ranking;
    }
    string ID;
    for(int i=0;i<M;i++){
        bool flag=false;
        cin>>ID; 
        for(int k=0;k<N;k++){     
            if(ID==students[k].ID){
                flag=true;
                for(int p=0;p<N;p++){
                    if(p+1==students[k].rank_A){
                        cout<<p+1<<" "<<"A"<<endl;
                        break;
                    }
                    else if(p+1==students[k].rank_C){
                        cout<<p+1<<" "<<"C"<<endl;
                        break;
                    }
                    else if(p+1==students[k].rank_M){
                        cout<<p+1<<" "<<"M"<<endl;
                        break;
                    }
                    else if(p+1==students[k].rank_E){
                        cout<<p+1<<" "<<"E"<<endl;
                        break;
                    }  
                }
            }
        if(flag)
            break;     
        }
        if(!flag){
            cout<<"N/A"<<endl;
        }
    } 
    return 0;
}

样例结果：