WA on #10求助
  • 板块CF2A Winner
  • 楼主44_FeiDing
  • 当前回复1
  • 已保存回复1
  • 发布时间2023/8/21 21:06
  • 上次更新2023/11/3 02:08:05
查看原帖
WA on #10求助
876232
44_FeiDing楼主2023/8/21 21:06
#include<map>
#include<iostream>
#include<string>
#define int long long
using namespace std;
int n,maxn=-0x7ffffffff-1;
map<string,int> a;
string ans;
signed main(){
	cin>>n;
	for(int i=1;i<=n;++i){
		string s;
		int k;
		cin>>s>>k;
		if(a.find(s)!=a.end()){
			a[s]+=k;
			if(maxn<a[s]){
				maxn=a[s];
				ans=s;
			}
		}else{
			a.insert(pair<string,int>(s,k));
			if(maxn<a[s]){
				maxn=a[s];
				ans=s;
			}
		}
	}
	cout<<ans;
}
2023/8/21 21:06
加载中...