PAT【天梯赛】7-11 悄悄关注

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<iostream>
using namespace std;
struct People1
{
char name[5];
}p1[6000];


struct People2
{
char name[5];
int num;
}p2[10010];
bool cmp(People2 x,People2 y)
{
if(strcmp(x.name,y.name)>0)
return 0;
else
return 1;
}
int main()
{
char str[5];
map<string,int>mapp;
   string name;
int n,m,sum=0,flag=0,xxx=0;
double ans;
scanf("%d",&n);
getchar();
for(int i=1; i<=n; i++)
{

cin>>name;
mapp[name]=1;
}
   
scanf("%d",&m);
for(int i=1; i<=m; i++)
{
scanf("%s%d",p2[i].name,&p2[i].num);
sum+=p2[i].num;
}
sort(p2+1,p2+1+m,cmp);
ans=sum/m;
for(int i=1; i<=m; i++)
{
        if(p2[i].num>ans&&!mapp[p2[i].name])
        {

        printf("%s\n",p2[i].name);
        flag=1;
    }
}
if(flag==0)
printf("Bing Mei You\n");
return 0;

}