L2-019 map

题目：https://www.patest.cn/contests/gplt/L2-019

#include <bits/stdc++.h>
using namespace std;

map <string,int> m;
vector <string> v;
int main(){
    int n,k,num;
    cin>>n;
    char s[25];
    for(int i=0;i<n;i++){
        cin>>s;
        m[s]=-1;
    }
    cin>>k;
    float sum=0;
    for(int i=0;i<k;i++){
        cin>>s>>num;
        sum+=num;
        if(m[s]!=-1)
            m[s]=num;
    }
    sum/=k;
    for(map<string,int>::iterator it=m.begin();it!=m.end();++it)
        if(it->second >sum) v.push_back(it->first);
    sort(v.begin(),v.end());
    if(v.size()==0){
        cout<<"Bing Mei You"<<endl;
        return 0;
    }
    for(int i=0;i<v.size();i++)
        cout<<v[i]<<endl;
    return 0;
}