按题意模拟即可......

使用到了之前文章使用到的精度控制。

测试样例：

10
A57908 85 Au
B57908 54 LanX
A37487 60 au
T28374 67 CMU
T32486 24 hypu
A66734 92 cmu
B76378 71 AU
A47780 45 lanx
A72809 100 pku
A03274 45 hypu

样例输出：

5
1 cmu 192 2
1 au 192 3
3 pku 100 1
4 hypu 81 2
4 lanx 81 2

AC代码：

#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
using namespace std;
#define base 10000
typedef long long ll;
const int N = 1e5 + 5;
map<string, int>mp;//映射
int tot = 1;struct node {string schol;int noi;ll score;int pers;//排序规则bool operator<(const node& t) const {if (score != t.score)return score > t.score;else if (pers != t.pers)return pers < t.pers;elsereturn schol < t.schol;}
}p[N];//按题意计分方式计分
ll getScore(char ch, double score)
{if (ch == 'T') {return (ll)score * 3 * base / 2;}else if (ch == 'B') {return (ll)score * 2 * base / 3;}else return (ll)score * base;}int main()
{int n;cin >> n;for (int i = 0; i < n; i++) {string id, schol;ll score;cin >> id >> score >> schol;for (int j = 0; schol[j]; j++) {schol[j] = tolower(schol[j]);}if (!mp[schol]) { //没记录过mp[schol] = tot; //为学校分配idp[tot].schol = schol;p[tot].score += getScore(id[0], score);p[tot].pers++;tot++; //准备下一个学校的id}else //记录过{int ind = mp[schol];p[ind].score += getScore(id[0], score);p[ind].pers++;}}for (int i = 1; i < tot; i++) {p[i].score /= base;}sort(p + 1, p + tot);p[1].noi = 1;for (int i = 1; i < tot; i++) {if (i != 1) { //判断位序，是否有并列if (p[i].score == p[i - 1].score) {p[i].noi = p[i - 1].noi;}else {p[i].noi = i;}}cout << p[i].noi << ' ' << p[i].schol << ' ' << p[i].score << ' ' << p[i].pers << endl;}return 0;
}