PAT甲级1012

solution

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 2010;
int vis[1000010];
struct node
{
    int id;
    int score[4], rank[4], best;

} stu[N];
int flag = -1;
bool cmp1(node x, node y)
{
    return x.score[flag] > y.score[flag];
}
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        cin >> stu[i].id >> stu[i].score[1] >> stu[i].score[2] >> stu[i].score[3];
        stu[i].score[0] = stu[i].score[1] + stu[i].score[2] + stu[i].score[3];
    }
    for (int flag = 0; flag <= 3; flag++)
    {
        sort(stu + 1, stu + 1 + n, cmp1);
        stu[0].rank[flag] = 1;
        for (int i = 1; i <= n; i++)
        {
            stu[i].rank[flag] = i + 1;
            if (stu[i].score[flag] == stu[i - 1].score[flag])
                stu[i].rank[flag] = stu[i - 1].rank[flag];
        }
    }
    for (int i = 1; i <= n; i++)
    {
        vis[stu[i].id] = i;
        stu[i].best = 0;
        int minn = stu[i].rank[0];
        for (int j = 1; j <= 3; j++)
        {
            if (minn > stu[i].rank[j])
            {
                minn = stu[i].rank[j];
                stu[i].best = j;
            }
        }
    }
    
    char c[5] = {'A', 'C', 'M', 'E'};
    for (int i = 1; i <= m; i++)
    {
        if (i != 1)
            puts("");
        int id;
        cin >> id;
        int temp = vis[id];
        if (temp == 0)
        {
            cout << "N/A";
        }
        else
        {
            int best = stu[temp].best;
            cout << stu[temp].rank[best] << " " << c[best];
        }
    }
}