CODEFORCES Day14

最新推荐文章于 2023-06-02 16:23:50 发布

G n a i L

最新推荐文章于 2023-06-02 16:23:50 发布

阅读量71

点赞数

分类专栏： codeforces

本文链接：https://blog.csdn.net/m0_51646205/article/details/119211075

版权

codeforces 专栏收录该内容

30 篇文章 0 订阅

订阅专栏

题目：

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.

题意：玩游戏，输出得分最高的玩家的名字，如果有得分一样的选手，那么输出最先到达的最高分数的选手的名字。

思路：名字+分数，string对int的映射关系，定义一个string对int映射的map容器，对分数进行操作，找出分数的最大值。再定义一个string对int映射的map容器，重新对分数操作，按照顺序找出最先到达最大值的选手。

#include<iostream>
#include<map>
#include<string>
using namespace std;
#define Max 1010
int a[Max];
string s[Max];
int n,num=-1000;
map<string, int>m,m1;
int main()
{
    cin>>n;
    for (int i=0; i<n; i++)
    {
        cin>>s[i]>>a[i];
        m[s[i]]+=a[i];
    }
    for (int i=0; i<n; i++)
    {
        if (m[s[i]]>num)
        {
            num=m[s[i]];
        }
    }
    for (int i=0; i<n; i++)
    {
        m1[s[i]]+=a[i];
        if (m[s[i]]==num&&m1[s[i]]>=num)
        {
            cout<<s[i]<<endl;
            return 0;
        }
    }
}