7-28 悄悄关注

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
using namespace std;
int n,k,cnt;
double sum;
map<string,bool>care;
map<string,double>ans;
string ss[10005];
int main()
{
	cin>>n;
	string s;
	for(int i=1;i<=n;i++)
	{
		cin>>s;
		care[s]=1;
	}
	cin>>k;
	for(int i=1,j;i<=k;i++)
	{
		cin>>s>>j;
		sum+=j;
		ans[s]=j;
	}
	sum/=k;
	map<string,double>::iterator it;
	for(it=ans.begin();it!=ans.end();it++)
	{
		if(!care[it->first]&&it->second>sum)
			ss[++cnt]=it->first;
	}
	if(cnt)
	{
		sort(ss+1,ss+1+cnt);
		for(int i=1;i<=cnt;i++)
		cout<<ss[i]<<endl; 
	}
	else
	cout<<"Bing Mei You";
	return 0;
}