Submission #168897

---

Source Code Expand

#include <iostream>
#include <string>
#include <map>

std::map<std::string, int> table;

int main(void) {
	int N;
	std::cin >> N;
	
	for(int n=0; n<N; ++n) {
		std::string name;
		std::cin >> name;
		
		auto itr = table.find(name);
		if(itr == table.end()) {
			table.insert( std::pair<std::string, int>(name, 0) );
		}
		else {
			int p = itr->second + 1;
			table.erase(itr);
			table.insert( std::pair<std::string, int>(name, p) );
		}
	}
	
	{
		int max = 0;
		std::string name;
		auto itr = table.begin();
		for(; itr!=table.end(); ++itr) {
			if(max < itr->second) {
				max = itr->second;
				name = itr->first;
			}
		}
		
		std::cout << name << std::endl;
	}
	
	return 0;
}

Submission Info

Judge Result