CodeForces - 2A Winner（map）

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.

Examples

input

Copy

3
mike 3
andrew 5
mike 2

output

Copy

andrew

input

Copy

3
andrew 3
andrew 2
mike 5

output

Copy

andrew

 

题目大意：n对数据给出每局游戏的分数（有负分），求分最高的那个人，如果分数一样，求最先到达这个分数的人；

思路很简单，但是刚开始用的数组做的，emmm，一言难尽qwq，写的很复杂：

#include <iostream>
#include <cstring>
using namespace std;
char ss[1005][50],str[50];
int a[1005][1005] = {0},b,d[1005] = {0};
int main()
{
    int n,k = 0,i,j;
    cin >> n;
    for(j = 0;j < n;j++)
    {
        cin >> str >> b;
        int flag = 0;
        for(i = 0;i < k;i++)
            if(strcmp(str,ss[i])==0)
            {
                a[i][j] = b;
                flag = 1;
                break;
            }
        if(flag == 0)
        {
			strcpy(ss[k],str);
            a[k][j] = b;
            k++;
        }
    }//存储
	for(j = 0;j < k;j++)
	    for(i = 1;i < n;i++)
			a[j][i] += a[j][i-1];//求分数和
    int mmax = 0,ans = 0,v;
    for(i = 0;i < k;i++)
    {
        if(a[i][n-1] > mmax)
        {
            mmax = a[i][n-1];
            v = i;
        }
    }//求最高分
    int m = 0;
    for(i = 0;i < k;i++)
        if(a[i][n-1] == mmax)
        {
            d[m] = i;
            ans++;
            m++;
        }//求几个人达到最高分
	int x = 0,flag1=0;
    if(ans == 1)
        cout << ss[v] << endl;//只有一个，直接输出
    else
	{
    for(i = 0;i < n;i++)
	{
        for(j = 0;j < m;j++)
        {
            if(a[d[j]][i] >= mmax)
            {
                x = d[j];
				flag1=1;
                break;
            }
        }
		if(flag1==1)
			break;
	}//很多人，求最先达到最高分的那个
        cout << ss[x] << endl;
	}
        return 0;
}

 

后来看了别人的博客：https://blog.csdn.net/zhaoxinfan/article/details/8995547

qwq突然觉得全程模拟，真的是傻得可爱qwq，大概人家一行代码，我用十行代码；

#include<iostream>
#include<map>
#include<string>
#include<algorithm>
#include<cstdio>
using namespace std;

int main()
{
    map <string,int> mp1,mp2;//mp1存储分数，mp2拿来模拟过程找最先达到最高分的那个
    string s[1010];
    int a[1010];
    int n;
    cin >>n;
    for(int i = 0;i < n;i++){
        cin >>s[i] >> a[i];
        mp1[s[i]]+=a[i];
    }//存储
    int maxn = 0,i;
    for(i = 0;i < mp1.size();i++)
        maxn = max(maxn,mp1[s[i]]);//找最大值
    for(i=0;mp1[s[i]]<maxn || (mp2[s[i]]+=a[i])<maxn;i++);
//注意这个分号，找到总分数等于最高分并且先达到最高分的人（因为有负分，所以必须满足两个条件）
    cout << s[i] << endl;
	return 0;
}