1012 The Best Rank 25

1012 The Best Rank 25

题目链接：1012 The Best Rank

问题思路

1. 使用4个数组分别储存三门课程成绩和平均成绩以及每条成绩对应的学号，然后将其进行排序得到排名

2. 使用另一个容器储存排序得到的排名

   注：这里排名时要注意相同分数排名是一致的，例如如果成绩是98 90 90 88，那么得到的排名是1 2 2 4而不是1 2 3 4

3. 读入查询，进行格式控制输出即可

源码

#include <cstdio>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;

char status[4] = {'A', 'C', 'M', 'E'};

bool cmp(pair<int, int> a, pair<int, int> b)
{
    return a.second > b.second;
}

int main()
{
    map<int, int[4]> records;
    vector<pair<int, int>> cprog, maths, eng, aver;
    int n, m;
    scanf("%d %d", &n, &m);
    for(int i = 0; i < n; i++)
    {
        pair<int, int> c, m, e, a;
        scanf("%d %d %d %d", &c.first, &c.second, &m.second, &e.second);
        m.first = e.first = a.first = c.first;
        a.second = (e.second+m.second+c.second)/3;
        cprog.push_back(c);maths.push_back(m);eng.push_back(e);aver.push_back(a);
    }
    sort(cprog.begin(), cprog.end(), cmp);
    sort(maths.begin(), maths.end(), cmp);
    sort(eng.begin(), eng.end(), cmp);
    sort(aver.begin(), aver.end(), cmp);
    for(int i = 0; i < n; i++)
    {
        records[aver[i].first][0] = ( i > 0 && aver[i].second == aver[i-1].second) ? records[aver[i-1].first][0] : i+1;
        records[cprog[i].first][1] = ( i > 0 && cprog[i].second == cprog[i-1].second) ? records[cprog[i-1].first][1] : i+1;
        records[maths[i].first][2] = ( i > 0 && maths[i].second == maths[i-1].second) ? records[maths[i-1].first][2] : i+1;
        records[eng[i].first][3] = ( i > 0 && eng[i].second == eng[i-1].second) ? records[eng[i-1].first][3] : i+1;
    }
    for(int i = 0; i < m; i++)
    {
        int id;
        scanf("%d", &id);
        if(records.find(id) == records.end()){
            printf("N/A\n");
        }else{
            int maxid = 0;
            for(int i = 1; i < 4; i++)
            {
                if(records[id][i] < records[id][maxid])
                    maxid = i;
            }
            printf("%d %c\n", records[id][maxid], status[maxid]);
        }
    }
    
    return 0;
}