PAT A1012 The Best Rank (25 分) 排序

    题目大意：给出学生的 id、c(计算机成绩)、m(数学成绩)、e(英语成绩)，要求输出指定 id 学生的最佳排名，也就是该学生在 a(平均成绩) 和 c、m、e的四个排名中最佳的，如果有多项有重复的排名，按照 a c m e的优先级选择优先级最高的一项。

    常规排序题，只不过要按照 a c m e四个尺度分别排名，排序用vector, 存储用map, 对于指定id，先判断是否在map中，再输出最佳的排名。

AC代码如下：

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstring>

using namespace std;

struct student
{
    string id;
    double a;
    int c, m, e;
    int aRank, cRank, mRank, eRank;
    student(){};
    student(string id, int c, int m, int e):id(id), c(c), m(m), e(e)
    {
        a = (c + m + e) * 1.0 / 3;
    }
};

bool cmpa(student u, student v)
{
    return u.a > v.a;
}

bool cmpc(student u, student v)
{
    return u.c > v.c;
}

bool cmpm(student u, student v)
{
    return u.m > v.m;
}

bool cmpe(student u, student v)
{
    return u.e > v.e;
}

void printBestRank(const student& s)
{
    int bestRank = min(min(s.aRank, s.cRank), min(s.mRank, s.eRank));
    printf("%d ", bestRank);
    if(s.aRank == bestRank) printf("A\n");
    else if(s.cRank == bestRank) printf("C\n");
    else if(s.mRank == bestRank) printf("M\n");
    else printf("E\n");
}

int main()
{
    int N, M;
    cin >> N >> M;
    map<string, student> mp;
    vector<student> vs;
    for (int i = 0; i < N; ++i)
    {
        char idTemp[10] = {0};
        int c, m, e;
        scanf("%s%d%d%d", idTemp, &c, &m, &e);
        string id = string(idTemp);
        mp[id] = student(id,c,m,e);
        vs.push_back(student(id,c,m,e));
    }

    sort(vs.begin(), vs.end(), cmpa);
    int aRank = 1;
    mp[vs[0].id].aRank = aRank++;
    for (int i = 1; i < vs.size(); ++i)
    {
        if(vs[i].a == vs[i-1].a) mp[vs[i].id].aRank = mp[vs[i-1].id].aRank;
        else mp[vs[i].id].aRank = aRank;
        aRank++;
    }

    sort(vs.begin(), vs.end(), cmpc);
    int cRank = 1;
    mp[vs[0].id].cRank = cRank++;
    for (int i = 1; i < vs.size(); ++i)
    {
        if(vs[i].c == vs[i-1].c) mp[vs[i].id].cRank = mp[vs[i-1].id].cRank;
        else mp[vs[i].id].cRank = cRank;
        cRank++;
    }

    sort(vs.begin(), vs.end(), cmpm);
    int mRank = 1;
    mp[vs[0].id].mRank = mRank++;
    for (int i = 1; i < vs.size(); ++i)
    {
        if(vs[i].m == vs[i-1].m) mp[vs[i].id].mRank = mp[vs[i-1].id].mRank;
        else mp[vs[i].id].mRank = mRank;
        mRank++;
    }

    sort(vs.begin(), vs.end(), cmpe);
    int eRank = 1;
    mp[vs[0].id].eRank = eRank++;
    for (int i = 1; i < vs.size(); ++i)
    {
        if(vs[i].e == vs[i-1].e) mp[vs[i].id].eRank = mp[vs[i-1].id].eRank;
        else mp[vs[i].id].eRank = eRank;
        eRank++;
    }

    for (int query = 0; query < M; ++query)
    {
        char idTemp[10] = {0};
        scanf("%s", idTemp);
        string id = string(idTemp);
        if(mp.find(id) != mp.end())
        {
            printBestRank(mp[id]);
        }
        else printf("N/A\n");
    }
    return 0;
}