天梯赛 L2-019 悄悄关注

很简单的一道题，不做解释

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
typedef long long ll;
const int N = 3e5 + 10;
const int mod = 998244353;
void solve() {
    int n;
    cin>>n;
    map<string,int> subs,cnt;
    for(int i = 1 ; i <= n ; i++){
    	string s;
    	cin>>s;
    	subs[s]++;
    }
    int m,sum = 0;;
    cin>>m;
    for(int i = 1 ; i <= m ; i++){
    	string s;
    	int x;
    	cin>>s>>x;
    	sum += x;
    	cnt[s] += x;
    }
    int now = 0;
    for(auto it : cnt){
    	int num = it.second;
    	string name = it.first;
    	if(subs[name] == 1){
    		continue;
    	}
    	if(num * m > sum && subs[name] == 0){
    		cout<<name<<endl;
    		now++;
    	}
    }
    if(now == 0){
    	cout<<"Bing Mei You";
    }
}
signed main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int tt = 1;
    //    cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}