codeforces - 2A - Winner

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

ss

题意：

n个人打牌，每次得到一个点数，问最后得到点数之和（设为max）最大的人是谁，若有拥有最大点数的人不止一个，则最先到达这个点数（>=max）的人为赢家。

思路：

使用map记录每个人最后的点数，遍历map，得到最大值key，再遍历一次map，将拥有最大点数的人存进一个vector中。然后遍历输入，判断谁先达到max这个值（>=max），即为赢家。

总结：

题意理解不清楚，思路开始时错误。

代码：

#include <iostream>
#include <cstring>
#include <string>
#include <map>
#include <utility>
#include <algorithm>
#include <vector>


using namespace std;

pair<string, int> arr[1500];

int main(){
	int n, po;
	string in;
	cin>>n;
	map<string, int> mp;
	for(int i=0; i<n; ++i){
		cin>>in>>po;
		mp[in] += po;
		arr[i].first = in;
		arr[i].second = po;
	}
	int tmp = -0x3f3f3f3f;
	for(map<string, int>::iterator it=mp.begin(); it!=mp.end(); ++it){
		string name = it->first;
		int cnt = it->second;
		if(tmp < cnt){
			tmp = cnt;
		}
	}
	vector<string> v;
	for(map<string, int>::iterator it=mp.begin(); it!=mp.end(); ++it){
		string name = it->first;
		int cnt = it->second;
		if(tmp == cnt){
			v.push_back(name);
		}
	}
	pair<string, int> ans;
	ans.first = "";
	ans.second = 0x3f3f3f3f;
	for(vector<string>::iterator it=v.begin(); it!=v.end(); ++it){
		int pos; int tot=0;
		for(int i=0; i<n; ++i){
			if(arr[i].first==(*it)){
				tot += arr[i].second;
				if(tot>=tmp) {
					pos = i;
					break;
				}
			}
		}
		if(ans.second>pos){
			ans.first = (*it);
			ans.second = pos;
		}

	}
	cout<<ans.first<<endl;
	return 0;
}