Codeforces 2A-Winner（模拟）

最新推荐文章于 2019-10-31 22:19:10 发布

原创最新推荐文章于 2019-10-31 22:19:10 发布 · 827 阅读

0 ·

CC 4.0 BY-SA版权

Codeforces 同时被 2 个专栏收录

31 篇文章

订阅专栏

STL

20 篇文章

订阅专栏

本文深入探讨了游戏开发领域的核心技术，包括游戏引擎、图形渲染、音视频处理等关键环节，为开发者提供全面的技术指导。

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.

Sample test(s)

input
3
mike 3
andrew 5
mike 2

output
andrew

input
3
andrew 3
andrew 2
mike 5

output
andrew卡了8次。。思维果然跟不上。题意：给出队员同一开始到结束的得分情况，求出总分最高的人，如果有多个，则输出第一个达到（大于等于）次总分最高分的人。可以用map模拟，首先求出总分最高分，然后求出总分最高分的人，从这些人中选一个最先达到总分最高分的人（重新模拟输入）#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <cmath>
#include <map>
using namespace std;
#define LL long long
string str[1010];
int t[1010];
int main()
{
	int n;
	while(cin>>n)
	{
	    map <string,int> m;
	    for(int i=0;i<n;i++)
		{
			cin>>str[i]>>t[i];
			m[str[i]]+=t[i];
		}
		int Max=-1;
		map <string,int>::iterator it=m.begin();
		while(it!=m.end())
		{
			if(Max<it->second)
				Max=it->second;
			it++;
		}
		map <string,bool> flag;
		it=m.begin();
		while(it!=m.end())
		{
			if(it->second==Max)
				flag[it->first]=true;
			it++;
		}
		m.clear();
		for(int i=0;i<n;i++)
		{
			if(flag.find(str[i])!=flag.end())
			{
			    m[str[i]]+=t[i];
			    if(m[str[i]]>=Max)
			    {
					cout<<str[i]<<endl;
					break;
			    }
			}
		}
	}
	return 0;
}