codeforces 2A-Winner (map)

最新推荐文章于 2019-06-08 16:32:24 发布

原创最新推荐文章于 2019-06-08 16:32:24 发布 · 299 阅读

0 ·

CC 4.0 BY-SA版权

map 专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种名为Berlogging的卡牌游戏胜负判断算法。该算法通过跟踪每轮游戏中玩家得分的变化来确定最终胜者。当游戏结束时，如果有两名或多名玩家积分相同且为最高，则最先达到至少等于该最高积分的玩家获胜。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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", wherename 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 tom) at the end of the game, than wins the oneof 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 follown lines, containing the information about the rounds in "name score" format in chronological order, wherename is a string of lower-case Latin letters with the length from 1 to 32, andscore 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

一开始读错题了,wa了好多发...

#include<stdio.h>
#include<map>
#include<iostream>
#include<string>
#include<string.h>
using namespace std;
struct p
{
    string strr;
    int num;
}a[2005];
map<string,int> p;
map<string,int> q;
int main()
{
    int n;
    int ans=-99999999;
    p.clear();
    q.clear();
    string str2;
    cin>>n;
    map<string,int>::iterator iter;
    for (int i=1;i<=n;i++)
    {
        string str;
        int score;
        cin>>str>>score;
        a[i].strr=str;
        a[i].num=score;
        if (p.find(str)==p.end()) p[str]=0;
        p[str]+=score;
    }
    for (iter=p.begin();iter!=p.end();iter++)
    {
       if (iter->second>ans) ans=iter->second;
    }
    for (int i=1;i<=n;i++)
    {
       if (p[a[i].strr]==ans)
       {
           q[a[i].strr]+=a[i].num;
          if (q[a[i].strr]>=ans)
         {
           cout<<a[i].strr<<endl;
             break;
         }
       }
    }
    return 0;
}