该博客介绍了Berland流行的卡牌游戏Berlogging的获胜规则。当游戏结束时，如果有且仅有一个玩家拥有最大分数，则该玩家为赢家。如果多个玩家的分数相同且为最大值，则首先达到这个最大分数的玩家获胜。博客中提供了一个C++代码示例，用于根据输入的游戏回合数据找出获胜者。通过对输入的回合数据进行处理，计算每个玩家的总分数，并确定最早达到最高分的玩家作为胜者。
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, th
最低0.47元/天 解锁文章
1654
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
