Submission #3219110

---

Source Code Expand

#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
#include <stdio.h>

typedef long long ll;
using namespace std;

int main(){
	int n;
	cin >> n;
	string s[n+1];
	ll a[n];
	for(int i=0;i<n;i++){
		cin >> s[i];
		a[i]=0;
	}
	a[n]=0;
	if(n==1){
		cout << s[0]<<endl;
	}
	else{
		for(int i=0;i<n-1;i++){
			for(int j=i+1;j<n;j++){
				if(s[i]==s[j]){
					a[i]++;
				}
			}
		}
		for(int i=0;i<n-1;i++){
			a[i+1]=max(a[i],a[i+1]);
		}
		for(int i=0;i<n;i++){
			if(a[n-1]==a[i]){
				cout << s[i] <<endl;
				return 0;
			}
		}
	}
	return 0;
}

Submission Info

Judge Result