【天梯赛】L2-019 悄悄关注 (25 point(s))

穿越隧道

map的应用

#include <bits/stdc++.h>
using namespace std;
const int N = 5e4 + 10;//若只开5e3，最后一个样例段错误。只是关注的人，还有悄悄关注的人的id<=1e4
map<string,int> mp,mmp; 
string ans[N];
int main(){
	int n;
	scanf("%d",&n);
	for(int i = 0; i < n; i++){
		string s;
		cin >> s;
		mp[s] = -1;
	}
	int m;
	scanf("%d",&m);
	int sum = 0;
	for(int i = 0; i < m; i++){
		string na;
		int num;
		cin >> na >> num;
		mmp[na] = num;
		sum += num;
	}
	int k = 0;
	map<string,int>::iterator it;
	for(it = mmp.begin(); it != mmp.end(); it++){
		if(!mp[it->first] && ((double)it->second > sum*1.0/m)){
			ans[k++] = it->first;
		}
	}
	sort(ans,ans + k);
	for(int i = 0; i < k; i++){
		cout << ans[i] << endl;
	}
	if(k == 0){
		puts("Bing Mei You");
	}
	return 0;
}