CF2A-Winner

#include<bits/stdc++.h>
using namespace std;
int n,y,xb,id=-1,sum=-99999999; 
string a[100005],x,ans;
struct win
{
	int id,past=INT_MIN,now;
};
map<string,win> f;
set<string> t;
int main()
{
	cin>>n;
	for(int i=1;i<=n;++i)
	{
		cin>>x>>y;
		if(!t.count(x))
		{
			a[++xb]=x;
			t.insert(x);
		}
		f[x].now+=y;
		if(f[x].now>f[x].past)
		{
			f[x].past=f[x].now;
			f[x].id=i;
		}
	}
	for(int i=1;i<=xb;++i)
	{
		//cout<<a[i]<<' '<<f[a[i]].now<<' '<<f[a[i]].id<<'\n';
		if(f[a[i]].now>sum)
		{
			ans=a[i];
			sum=f[a[i]].now;
			id=f[a[i]].id;
		}
		if(f[a[i]].now==sum&&f[a[i]].id<id)
		{
			ans=a[i];
			sum=f[a[i]].now;
			id=f[a[i]].id;
		}
	}
	cout<<ans;
}

提交记录 求错误数据QwQ