[数据结构与算法]笔试：《扑克牌游戏》

题目：《扑克牌游戏》

代码如下：

#include <iostream>
#include <string>
#include <map>
using namespace std;

map<string, pair<int, int> > mp;    //姓名，成绩、成绩最后时间
int main() {
    int T, n, grade;
    string name;
    cin >> T;
    while (T--) {
        mp.clear();
        cin >> n;
        for (int i = 0; i < n; i++) {   //i代表时间
            cin >> name >> grade;
            if (mp.count(name)) {
                mp[name].first += grade;
                mp[name].second = i;
            } else {
                mp[name] = make_pair(grade, i);
            }
        }
        map< string, pair<int, int> >::iterator it;
        int maxm = -2147483648, posTime = 2147483647;
        string posName = "";
        for (it = mp.begin(); it != mp.end(); it++) {
            //cout << "===" << it->first << " " << it->second.first << " " << it->second.second << endl;
            if (it->second.first > maxm) {
                maxm = it->second.first;
                posTime = it->second.second;
                posName = it->first;
            } else if (it->second.first == maxm) {
                if (it->second.second < posTime) {
                    posTime = it->second.second;
                    posName = it->first;
                }
            }
        }
        cout << posName << endl;
    }
    return 0;
}
/*
Input:
2
3
mike 3
andrew 5
mike 2
3
andrew 3
andrew 2
mike 2

Output:
andrew
andrew

*/