个人练习-PAT甲级-1141 PAT Ranking of Institutions

题目链接https://pintia.cn/problem-sets/994805342720868352/problems/994805344222429184

题目大意：给出一堆人的考试id、成绩、学校名称，求学校的排名，按照总分降序、人数降序、名称字母序排序。总分是三种考试类型的成绩加权。

思路：学校们用一个map<string, Node>来存即可，string是学校名称，Node包含分数等信息，定义如下

class Node{
public:
    string name;
    int tws, Ns;
    int v[3];

    Node(){v[0] = v[1] = v[2] = 0;}

};

记得写个函数把所有学校名称转小写

string toLower(string str) {
    for (int i = 0; i < str.length(); i++) {
        if (str[i] >= 'A' && str[i] <= 'Z')
            str[i] = str[i] + 'a' - 'A';
    }
    return str;
}

全部读入后，先一个个插进vector里，再排序

bool cmp(Node x, Node y) {
    if (x.tws != y.tws)
        return x.tws > y.tws;
    else if (x.Ns != y.Ns)
        return x.Ns < y.Ns;
    else
        return x.name < y.name;
}

排名时rank默认为在vector中的顺序，当分数和上一个记录的分数一样时，排名也变成上一个的排名

    int last_score = li[0].tws;
    int last_rank = 1;
    for (int i = 0; i < li.size(); i++) {
        int rank = i+1;
        if (i != 0 && last_score == li[i].tws)
            rank = last_rank;

        cout << rank << " " << li[i].name << " " << li[i].tws << " " << li[i].Ns << endl;

        last_rank = rank;
        last_score = li[i].tws;
    }

完整代码

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


using namespace std;


class Node{
public:
    string name;
    int tws, Ns;
    int v[3];

    Node(){v[0] = v[1] = v[2] = 0;}

};


map<string, Node> rk;
vector<Node> li;


bool cmp(Node x, Node y) {
    if (x.tws != y.tws)
        return x.tws > y.tws;
    else if (x.Ns != y.Ns)
        return x.Ns < y.Ns;
    else
        return x.name < y.name;
}


string toLower(string str) {
    for (int i = 0; i < str.length(); i++) {
        if (str[i] >= 'A' && str[i] <= 'Z')
            str[i] = str[i] + 'a' - 'A';
    }
    return str;
}



int main() {
    int N;
    scanf("%d", &N);
    for (int i = 0; i < N; i++) {
        string id, school;
        int score, idx;
        cin >> id >> score >> school;
        school = toLower(school);
        switch (id[0]) {
            case 'B': idx = 0;break;
            case 'A': idx = 1;break;
            default: idx = 2;
        }
        rk[school].name = school;
        rk[school].Ns++;
        rk[school].v[idx] += score;
    }

    for (auto it = rk.begin(); it != rk.end(); it++) {
        it->second.tws = it->second.v[0]/1.5 + it->second.v[1] + it->second.v[2]*1.5;
        li.push_back(it->second);
    }

    sort(li.begin(), li.end(), cmp);

    cout << li.size() << endl;
    int last_score = li[0].tws;
    int last_rank = 1;
    for (int i = 0; i < li.size(); i++) {
        int rank = i+1;
        if (i != 0 && last_score == li[i].tws)
            rank = last_rank;

        cout << rank << " " << li[i].name << " " << li[i].tws << " " << li[i].Ns << endl;

        last_rank = rank;
        last_score = li[i].tws;
    }


    return 0;
}