2A. Winner

A. Winner
time limit ：per test 1 second
memory limit： per test 64 megabytes
input： standard input
output： standard output
The winner of the card game popular in Berland “Berlogging” is determined according to the following rules. If at the end of the game there is only one player with the maximum number of points, he is the winner. The situation becomes more difficult if the number of such players is more than one. During each round a player gains or loses a particular number of points. In the course of the game the number of points is registered in the line “name score”, where name is a player’s name, and score is the number of points gained in this round, which is an integer number. If score is negative, this means that the player has lost in the round. So, if two or more players have the maximum number of points (say, it equals to m) at the end of the game, than wins the one of them who scored at least m points first. Initially each player has 0 points. It’s guaranteed that at the end of the game at least one player has a positive number of points.

Input
The first line contains an integer number n (1  ≤  n  ≤  1000), n is the number of rounds played. Then follow n lines, containing the information about the rounds in “name score” format in chronological order, where name is a string of lower-case Latin letters with the length from 1 to 32, and score is an integer number between -1000 and 1000, inclusive.

Output
Print the name of the winner.

Examples
input：
3
mike 3
andrew 5
mike 2
output
andrew
input
3
andrew 3
andrew 2
mike 5
output：
andrew

思路：首先计算出每个人最后所得分数和所有人中的最高分数，然后再寻找出那些得最高分数人中谁第一个超过或者等于最高分数。
当计算所有人的最高分数时需要注意得分可能是负分，当为负分时，最高分数可能会被改变。

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

struct element{
    string name;
    int score;
};

int main(int argc, char *argv[])
{
    int N;
    cin>>N;
    vector<element> sequence;
    map<string,int> mp;
    map<string,int> res_mp;
    element res_max; 
    bool first = true;
    while(N--){
        element temp;
        cin>>temp.name>>temp.score;
        sequence.push_back(temp);
        map<string,int>::iterator it;
        if((it=mp.find(temp.name))!=mp.end()){
            mp[temp.name]+=temp.score;
            if(temp.score<0&&temp.name==res_max.name){ 
                string temp_max_name=temp.name;
                int temp_max_score=mp[temp.name];
                for(map<string,int>::iterator it = mp.begin();it!=mp.end();it++){
                    if(it->second>temp_max_score){
                        temp_max_name = it->first;
                        temp_max_score = it->second;
                    }
                } 
                res_max.score = temp_max_score;
                res_max.name = temp_max_name;
            } 
        }
        else{
            res_mp[temp.name]=0;
            mp[temp.name]=temp.score;
            if(first){
                first = false;
                res_max.name = temp.name;
                res_max.score = temp.score;
            }
        }
        if(mp[temp.name]>res_max.score){
            res_max.name = temp.name;
            res_max.score = mp[temp.name];
        } 
    }

    for(int i=0;i<sequence.size();i++){
        string name = sequence[i].name;
        int score = sequence[i].score;
        res_mp[name]+=score;
        if(res_mp[name]>=res_max.score&&mp[name]==res_max.score){
            res_max.name = name; 
            break;
        } 
    }
    cout<<res_max.name<<endl;
    return 0;
}