AcWing 1800. 不做最后一个!
原题链接
简单
作者:
来不及了
,
2022-04-05 21:49:43
,
所有人可见
,
阅读 118
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef pair<int, int> PII;
const int N = 110;
vector<int> v;
int n;
unordered_map<string,int> mp;
string names[] = {"Bessie","Elsie","Daisy","Gertie","Annabelle","Maggie","Henrietta"};
int main()
{
cin>>n;
for(int i=0;i<7;i++) mp[names[i]] = 0;
for (int i = 0; i < n; i ++ )
{
string name;
int x;
cin>>name>>x;
mp[name]+=x;
}
for (int i = 0; i < 7; i ++ ) v.push_back(mp[names[i]]);
sort(v.begin(),v.end());
int target = -1;
for (int i = 1; i < 7; i ++ )
{
if(v[i]!=v[0]) {target = v[i];break;}
}
if(target == -1) cout<<"Tie"<<endl;
else
{
int sum = 0;
string ans;
for(auto x : mp)
{
if(x.second == target)
{
ans = x.first;
sum++;
}
}
if(sum > 1) cout<<"Tie"<<endl;
else cout<<ans<<endl;
}
return 0;
}