1085 PAT单位排行 (25 分)

1085 PAT单位排行 (25 分)

题目入口：https://pintia.cn/problem-sets/994805260223102976/problems/994805260353126400

AC代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <unordered_map>
#include <string>
#include <cctype>
#include <utility>
#include <vector>
using namespace std;
unordered_map<string, double> university;
unordered_map<string, int> pcnt;
typedef pair<string, double> PAIR;
bool cmp(const PAIR& x, const PAIR& y){
    if (int (x.second) == int (y.second)){
        if (pcnt[x.first] == pcnt[y.first])
          return x.first < y.first;
        return pcnt[x.first] < pcnt[y.first];
    }
    return int (x.second) > int (y.second);
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    string id, scname;
    double grade;
    for (int i = 1; i <= n; i++){
        cin >> id >> grade >> scname;
        for (int i = 0; i < scname.size(); i++) scname[i] = tolower(scname[i]);
        switch (id[0]){
            case 'A': university[scname] += grade; break;
            case 'B': university[scname] += (grade/1.5); break;
            case 'T': university[scname] += grade*1.5; break;
        }
        pcnt[scname] += 1;
    }
    cout << university.size() << endl;
    vector<PAIR> transfer(university.begin(), university.end());
    sort(transfer.begin(), transfer.end(), cmp);
    int rank = 1, buffer = 1;
    for (int i = 0; i < transfer.size(); i++){
        cout << rank << " ";
        if (int (transfer[i].second) == int (transfer[i+1].second)) buffer++;
        else {
            rank += buffer;
            buffer = 1;
        }
        cout << transfer[i].first << " " << int (transfer[i].second)
        << " " << pcnt[transfer[i].first] << endl;
    }
    return 0;
}