2A. Winner

A. Winner

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<cstdio> 
#include<map>
#include <string>
#include<iostream>
using namespace std;

int main()
{

	int num=0,score[1000],max_score=-100000000;
	map<string,int> a,b;//用map容器建立一对一的人名和分数档案 
	scanf("%d",&num);
	char name[1000][35],max_name[35]; 
	for (int i=0;i<num;i++)//记录每回合谁，得了多少分
	{
		scanf("%s",&name[i]);
		scanf("%d",&score[i]);
	}
	for(int j=0;j<num;j++)
	{
		if(!a.count(name[j]))
		{
			a.insert(map<string,int>::value_type(name[j],score[j]));//如果这个回合得分的人没在档案中给他加进去（写复杂了，应该直接赋值） 
		}
		else
		{
			a[name[j]]=a.find(name[j])->second+score[j];//find的用法，->first对应key，second对应value 
		}
}
	

    for(map<string,int>::iterator iter = a.begin(); iter != a.end(); iter++)  //迭代器循环 
    {
		if(max_score<iter->second)
		{
			max_score=iter->second;//记录最大值 
		}
	}
		
			for(int j=0;j<num;j++)//重新迭代 
	{
		if(!b.count(name[j]))
		{
			b.insert(map<string,int>::value_type(name[j],score[j])); 
		}
		else
		{
			b[name[j]]=b[name[j]]+score[j];
		}
		if ((a[name[j]]==max_score)&&(b[name[j]]>=max_score))//看看哪个最终最大值的人第一个达到过最大分数 
		{
			printf("%s",name[j]);
			break;
		}
}
	return 0;
}

遇到的问题：迭代器循环方式
map容器更新value方式