poj2643 (STL中map的使用）

Description
Canada has a multi-party system of government. Each candidate is generally associated with a party, and the party whose candidates win the most ridings generally forms the government. Some candidates run as independents, meaning they are not associated with any party. Your job is to count the votes for a particular riding and to determine the party with which the winning candidate is associated.
Input
The first line of input contains a positive integer n satisfying 2 <= n <= 20, the number of candidates in the riding. n pairs of lines follow: the first line in each pair is the name of the candidate, up to 80 characters; the second line is the name of the party, up to 80 characters, or the word “independent” if the candidate has no party. No candidate name is repeated and no party name is repeated in the input. No lines contain leading or trailing blanks.
The next line contains a positive integer m <= 10000, and is followed by m lines each indicating the name of a candidate for which a ballot is cast. Any names not in the list of candidates should be ignored.
Output
Output consists of a single line containing one of:
The name of the party with whom the winning candidate is associated, if there is a winning candidate and that candidate is associated with a party.
The word “independent” if there is a winning candidate and that candidate is not associated with a party.
The word “tie” if there is no winner; that is, if no candidate receives more votes than every other candidate.

intput

3
Marilyn Manson
Rhinoceros
Jane Doe
Family Coalition
John Smith
independent
6
John Smith
Marilyn Manson
Marilyn Manson
Jane Doe
John Smith
Marilyn Manson

output

Rhinoceros

题目大意，
n个人有好几个个党派，投票出党派最多人的党派，
（使用map形成映射）

下面给出AC代码以及代码注释

#include<iostream>
#include<map>
#include<string>
using namespace std;
int main()
{
	map<string,string>p;
	map<string,int>q;//形成相对应关系 
	p.clear();
	q.clear();//清空 
	int n,m;
	int i,j,max,flag;
	max=0;flag=0; 
	string s1,s2,name,temp;
	cin>>n;
	getchar();//吸收回车 
	for(i=0;i<n;i++)
	{
		getline(cin,s1);
		getline(cin,s2);//输入 
		p[s1]=s2;//名字和党派形成对应 
	}
	cin>>m;
	getchar();
	for(int j=0;j<m;j++) 
	{
		getline(cin,name);//输入投票清况 
		q[name]++;//对应的党派数量增加 
		if(q[name]>max)//找出最大党派 
		{
			max=q[name];
			temp=p[name];
			flag=1;//做标记 
		}
		else if(q[name]==max)
		{
			flag=0;
		}
		
	}
	if(flag==1)//根据标记结果输出 
	cout<<temp<<endl;
	else
	cout<<"tie"<<endl;
	return 0;
}

谢谢支持！一键三连！