Submission #168890

---

Source Code Expand

/*
 * Title:B - 投票
 * abc008b.cpp
 *  Created on: 2014/05/10
 *      Author: kyave
 */

#include <iostream>
#include <stdio.h>
#include <sstream>
#include <string>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef long long ll;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define REP(i,n) FOR(i,0,n)
#define pb push_back
#define fs first
#define se second
#define mp make_pair
#define INF 1 << 29

int main(){
	int n;
	string list[50];
	cin >> n;
	REP(i,n) cin >> list[i];

	sort(list,list+n);
	int vmax,tmp;
	vmax = tmp = 0;
	string ans = list[0];
	FOR(i,1,n) {
		if(list[i-1] == list[i]) tmp++;
		else {
			if(vmax < tmp){
				vmax = tmp;
				ans = list[i-1];
				tmp = 0;
			}
		}
	}
	cout << ans << endl;



 	return 0;
}

Submission Info

Judge Result