HDOJ1003 map

walter1990

于 2013-03-17 22:18:14 发布

阅读量521

点赞数

文章标签： ACM水题

本文链接：https://blog.csdn.net/suichen1/article/details/8685084

版权

#include <iostream>
#include <string>
#include <map>
using namespace std;

int main () {

	int n;
	int i;

	map<string, int> mp;
	string str;
	map<string, int>::iterator iter;

	while(scanf("%d", &n) != EOF && n) {
	
		mp.clear();

		for(i = 1; i <= n; i ++) {

			cin >> str;

			mp[str]++;
		}

		int max = -1;

		for(iter = mp.begin(); iter != mp.end(); iter ++) {
		
			if(iter->second > max) {
			
				max = iter->second;
				str = iter->first;
			}
		}

		cout << str << endl;
	}
	return 0;
}