#include<algorithm> #include<iostream> #include<set> #include<vector> usingnamespacestd; typedef pair<string, int> P; boolcmp(P a, P b){ return a.first < b.first; } intmain(){ int n, m, x; int flag = 1, sum = 0; scanf("%d", &n); string name; vector<P> v; set<string> se; //用来判断是否在关注列表中 for (int i = 0; i < n; i++) { cin >> name; se.insert(name); } scanf("%d", &m); for (int i = 0; i < m; i++) { cin >> name >> x; v.push_back({name, x}); sum += x; } sort(v.begin(), v.end(), cmp); sum /= m; for (auto it : v) { if (it.second > sum && se.find(it.first) == se.end()) { cout << it.first << endl; flag = 0; } } if (flag) cout << "Bing Mei You" << endl; return0; }