Submission #168771

---

Source Code Expand

#include <sstream>
#include<stdlib.h>
#include <string>
#include<string.h>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include<math.h>
using namespace std;
typedef long long ll;
#define INF 100000000
#define EPS 0.000001
#define MAX_N 100001

int main(){

	map<string, int>m;

	char N[50][100];
	int n;
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> N[i];
		m[N[i]] = 0;
	}
	int Max = 0;
	for(int i = 0; i < n; i++){
		m[N[i]]++;
		Max = max(Max, m[N[i]]);
	}

	for(int i = 0; i < n; i++){
		if(Max == m[N[i]]){
			cout << N[i] << endl;
			break;
		}
	}

	return 0;

}

Submission Info

Judge Result