7-11.悄悄关注

代码

#include <bits/stdc++.h>

using namespace std;

const int N = 5e3 + 10, M = 1e4 + 10;

int n, m;
int nums[M];
string f[N], t[M];
vector<string> res;

bool check(string name) {
    for (int i = 0; i < n; i++) {
        if (name == f[i]) return true;
    }
    return false;
}

int main() {
    // freopen("in.txt", "r", stdin);

    cin >> n;
    for (int i = 0; i < n; i++) cin >> f[i];

    int sum = 0;
    cin >> m;
    for (int i = 0; i < m; i++) {
        string name;
        int num;
        cin >> t[i] >> nums[i];
        sum += nums[i];
    }

    double avg = sum / m;
    for (int i = 0; i < m; i++) {
        if (!check(t[i]) && nums[i] > avg) res.push_back(t[i]);
    }
    sort(res.begin(), res.end());

    if (res.size() == 0) {
        cout << "Bing Mei You" << endl;
        return 0;
    }
    for (int i = 0; i < res.size(); i++) cout << res[i] << endl;

    return 0;
}