大家看看这个代码pta甲级1012

Question

#include<iostream>
using namespace std;
#include<algorithm>
#include<map>
struct people {
    int id;
    int score[4];
    int rank[4];
};
bool comp0(struct people a,struct people b)
{
    return a.score[0] > b.score[0];
}
bool comp1(struct people a, struct people b)
{
    return a.score[1] > b.score[1];
}
bool comp2(struct people a, struct people b)
{
    return a.score[2] > b.score[2];
}
bool comp3(struct people a, struct people b)
{
    return a.score[3] > b.score[3];
}

int main()
{
    struct people man[2005];
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        cin >> man[i].score[1] >> man[i].score[2] >> man[i].score[3];
        man[i].score[0] = man[i].score[1] + man[i].score[2] + man[i].score[3];
        man[i].rank[0] = man[i].rank[1] = man[i].rank[2] = man[i].rank[3] = 0;
    }
    //排序
        //A
    sort(man, man + n, comp0);
    for (int i = 0; i < n; i++) {
        if (man[i].score[0] == man[i - 1].score[0] && i >= 1) {
            man[i].rank[0] = man[i - 1].rank[0];
        }
        else {
            man[i].rank[0] = i + 1;
        }
    }
    //C
    sort(man, man + n, comp1);
    for (int i = 0; i < n; i++) {
        if (man[i].score[1] == man[i - 1].score[1] && i >= 1) {
            man[i].rank[1] = man[i - 1].rank[1];
        }
        else {
            man[i].rank[1] = i + 1;
        }
    }
    //M
    sort(man, man + n, comp2);
    for (int i = 0; i < n; i++) {
        if (man[i].score[2] == man[i - 1].score[2] && i >= 1) {
            man[i].rank[2] = man[i - 1].rank[2];
        }
        else {
            man[i].rank[2] = i + 1;
        }
    }
    //E
    sort(man, man + n, comp3);
    for (int i = 0; i < n; i++) {
        if (man[i].score[3] == man[i - 1].score[3] && i >= 1) {
            man[i].rank[3] = man[i - 1].rank[3];
        }
        else {
            man[i].rank[3] = i + 1;
        }
    }

    //输出
    for (int i = 0; i < m; i++) {
        int mid;
        cin >> mid;
        for (int j = 0; j < n; j++) {
            if (mid == man[j].id) {
                int min = 9999;
                for (int v = 0; v < 4; v++) {
                    if (man[j].rank[v] < min) {
                        min = man[j].rank[v];
                    }
                }
                if (min == man[j].rank[0]) {
                    cout << man[j].rank[0] << " A" << endl;
                }
                else if (min == man[j].rank[1]) {
                    cout << man[j].rank[1] << " C" << endl;
                }
                else if (min == man[j].rank[2]) {
                    cout << man[j].rank[2] << " M" << endl;
                }
                else {
                    cout << man[j].rank[3] << " E" << endl;
                }
            }
            else {
                cout << "N/A" << endl;
            }
        }
    }


    system("pause");
    return 0;
}