团体程序设计天梯赛 L2-019 悄悄关注

#include<bits/stdc++.h>
using namespace std;
bool cmp(string s,string k){
	return s<k;
}
int main(){
	map<string,int>mp;
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		string s;
		cin>>s;
		mp[s]=1;
	}
	int k;
	cin>>k;
	vector<string>a;
	vector<string>now;
	map<string,int>mp2;
	int to=0; 
	for(int j=0;j<k;j++){
		string s;
		int m;
		cin>>s;
		cin>>m;
		to+=m;
		mp2[s]=m;
		a.push_back(s);
	}
	to=to/k;
	for(int j=0;j<k;j++){
		if(mp2[a[j]]>to&&mp[a[j]]==0)
		now.push_back(a[j]);
	}
	if(now.size()!=0){
	sort(now.begin(),now.end(),cmp);
	for(int i=0;i<now.size();i++){
		cout<<now[i]<<endl;
	}
}
	else
	cout<<"Bing Mei You";
	return 0;
}