POJ - 2643 Election

Uncle_Sugar

于 2016-02-24 20:08:14 发布

阅读量236

点赞数

分类专栏： STL的使用文章标签： map的使用

本文链接：https://blog.csdn.net/sinat_29278271/article/details/50733177

版权

STL的使用专栏收录该内容

13 篇文章 0 订阅

订阅专栏

1.题面

http://poj.org/problem?id=2643

2.解题思路

找出一场选举中得票最多的人，然后输出这个人所属的党派。用两个map就好，水水水。

3.解题代码

/*****************************************************************
    > File Name: tmp.cpp
    > Author: Uncle_Sugar
    > Mail: uncle_sugar@qq.com
    > Created Time: 2016年02月24日 星期三 11时01分36秒
 ****************************************************************/
# include <cstdio>
# include <cstring>
# include <cmath>
# include <cstdlib>
# include <climits>
# include <iostream>
# include <iomanip>
# include <set>
# include <map>
# include <vector>
# include <stack>
# include <queue>
# include <algorithm>
using namespace std;


const int debug = 1;
const int size  = 5000 + 10; 
typedef long long ll;

struct candidate{
	string name;
	string party;
	candidate(){}
	candidate(const string& _name,const string& _party):name(_name),party(_party){}
	bool operator < (const candidate& cmper)const{
		return name < cmper.name;
	}
};
map<string,string> NameParty_mp;
map<string,int>	NameVotes_mp;
int main()
{
	std::ios::sync_with_stdio(false);cin.tie(0);
	int i,j,k;
	int n,m;
	while (cin >> n){
		string name,party;
		getline(cin,name);
		for (i=0;i<n;i++){
			getline(cin,name);
			getline(cin,party);
			NameParty_mp[name] = party;
		}
		cin >> m;
		getline(cin,name);
		for (i=0;i<m;i++){
			getline(cin,name);
			NameVotes_mp[name]++;
		}
		int flag=0;string ans;
		map<string,int>::iterator it;
		for (it=NameVotes_mp.begin();it!=NameVotes_mp.end();it++){
			if (it==NameVotes_mp.begin()){
				ans = it->first;
				flag = 1;
			}else {
				if (NameVotes_mp[ans]<it->second){
					ans = it->first;
					flag = 1;
				}
				else if (NameVotes_mp[ans]==it->second)
					flag = 0;
			}
		}
		if (flag==0){
			cout << "tie" << '\n';
		}else {
			cout << NameParty_mp[ans] << '\n'; 
		}
	}
	return 0;
}