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

坑点：mp.size() 的值为2倍的映射数量，一开始v的尺寸初始化错误了
还有就是用来整体大小写转化
transform(temp_school.begin(), temp_school.end(), temp_school.begin(), ::tolower);
函数将对从输入参数的first1-last1的全部变量做op函数操作。结果保存到result中，或是通过返回值返回。

代码

  1. #include<string>
  2. #include<iostream>
  3. #include<map>
  4. #include<vector>
  5. #include<cstdio>
  6. #include<algorithm>
  7. using namespace std;
  9. struct School{
  10.     int rank, nums, total2;
  11.     double total1;
  12.     string name;
  13. };
  15. double Cal(char a, double b){
  16.     if(a == 'B') return b / 1.5;
  17.     else if(a == 'A') return b;
  18.     else if(a == 'T') return b * 1.5;
  19. }
  21. bool cmp(School a, School b){
  22.     if(a.total2 != b.total2) return a.total2 > b.total2;
  23.     else if(a.nums != b.nums) return  a.nums < b.nums;
  24.     else return a.name < b.name;
  25. }
  28. int main(){
  29.     int n;
  30.     string temp_id, temp_school;
  31.     double temp_score;
  32.     map<string, School > mp;
  33.     scanf("%d", &n);
  34.     for(int i = 0; i < n; i++){
  35.         cin >> temp_id >> temp_score >> temp_school;
  36.         transform(temp_school.begin(), temp_school.end(), temp_school.begin(), ::tolower);
  37.         if(mp.find(temp_school) == mp.end()){
  38.             mp[temp_school].name = temp_school;
  39.             mp[temp_school].nums = 1;
  40.             mp[temp_school].total1 = Cal(temp_id[0], temp_score);
  41.         } else {
  42.             mp[temp_school].nums++;
  43.             mp[temp_school].total1 += Cal(temp_id[0], temp_score);
  44.         }
  45.     }
  46.     vector<School> v;
  47.     for(auto it = mp.begin(); it != mp.end(); it++){
  48.         it->second.total2 = (int)it->second.total1;
  49.         v.push_back(it->second);
  50.     }
  51.     sort(v.begin(), v.end(), cmp);
  52.     cout << v.size() << endl;
  53.     v[0].rank = 1;
  54.     for(int i = 1; i < v.size(); i++){
  55.         if(v[i].total2 == v[i - 1].total2) v[i].rank = v[i - 1].rank;
  56.         else v[i].rank = i + 1;
  57.     }
  58.     for(int i = 0; i < v.size(); i++){
  59.         cout << v[i].rank <<" "<< v[i].name <<" "<< v[i].total2 <<" "<< v[i].nums << endl;
  60.     }
  61.     return 0;
  62. }