L2-019 悄悄关注

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
using namespace std;
struct node
{
string s1;
double num;
} N[10010];
int main()
{
map<string,int> p1;
set<string> p2,p3;
int n;
cin>>n;
for(int i=0;i<n;i++)
{
string s1;
cin>>s1;
p2.insert(s1);
}
int m;
double sum=0.0;
cin>>m;
for(int i=0;i<m;i++)
{
cin>>N[i].s1>>N[i].num;
sum+=N[i].num;
}
sum/=m;
for(int i=0;i<m;i++)
{
if(N[i].num>sum&&!p2.count(N[i].s1))
p3.insert(N[i].s1);
}
if(!p3.empty())
{
for(set<string>::iterator it1=p3.begin();it1!=p3.end();it1++)
cout<<*it1<<endl;
}
else
cout<<"Bing Mei You\n";
return 0;
}