PAT(甲) - 1012 The Best Rank

#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    int n, m;
    cin >> n >> m;
    int score[3][n];
    double avg[n];
    int rank[4][n];
    string id[n];
    string classes[4] = {"A", "C", "M", "E"};
    for (int i = 0; i < n; i++)
    {
        cin >> id[i];
        int sum = 0;
        for (int j = 0; j < 3; j++)
        {
            cin >> score[j][i];
            sum += score[j][i];
        }
        avg[i] = sum * 1.0 / 3;
    }
    for (int i = 0; i < n; i++)
    {
        int coun = 0;
        for (int j = 0; j < n; j++)
        {
            if (avg[j] > avg[i])
                coun++;
        }
        rank[0][i] = coun + 1;
    }
    for (int k = 0; k < 3; k++)
    {
        for (int i = 0; i < n; i++)
        {
            int coun = 0;
            for (int j = 0; j < n; j++)
            {
                if (score[k][j] > score[k][i])
                    coun++;
            }
            rank[k + 1][i] = coun + 1;
        }
    }
    for (int i = 0; i < m; i++)
    {
        string idd;
        cin >> idd;
        int index;
        for (index = 0; index < n; index++)
        {
            if (!id[index].compare(idd))
                break;
        }
        if (index >= n)
            cout << "N/A" << endl;
        else
        {
            int minn = 1e6;
            for (int j = 0; j < 4; j++)
            {
                minn = min(minn, rank[j][index]);
            }
            for (int j = 0; j < 4; j++)
            {
                if (rank[j][index] == minn)
                {
                    cout << minn << " " << classes[j] << endl;
                    break;
                }
            }
        }
    }
}