L2-019 悄悄关注 (25 分)

题目链接

输入样例1：

10 GAO3 Magi Zha1 Sen1 Quan FaMK LSum Eins FatM LLao
8
Magi 50
Pota 30
LLao 3
Ammy 48
Dave 15
GAO3 31
Zoro 1
Cath 60

输出样例1：

Ammy
Cath
Pota

输入样例2：

11 GAO3 Magi Zha1 Sen1 Quan FaMK LSum Eins FatM LLao Pota
7
Magi 50
Pota 30
LLao 48
Ammy 3
Dave 15
GAO3 31
Zoro 29

输出样例2：

Bing Mei You

答案：

#include <iostream>
#include<bits/stdc++.h>
#define PII pair<int,int>
#define mem(a,b) memset(a,b,sizeof(a))
const int N = 1e5 + 10;
using namespace std;

set<string>st;
set<string>ans;

struct node{
    string s;
    int sum;
}dp[N];

int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        string s;
        cin>>s;
        st.insert(s);
    }
    cin>>n;
    int sum=0;
    for(int i=1;i<=n;i++){
        cin>>dp[i].s>>dp[i].sum;
        sum+=dp[i].sum;
    }
    sum/=n;
    for(int i=1;i<=n;i++){
        if(dp[i].sum>sum){
            if(st.count(dp[i].s)==0){
                ans.insert(dp[i].s);
            }
        }
    }
    if(!ans.size()) puts("Bing Mei You");
    else{
        set<string>::iterator it;
        for(it=ans.begin();it!=ans.end();it++){
            cout<<*it<<endl;
        }
    }
    return 0;
}