Submission #3979428

---

Source Code Expand

#include "bits/stdc++.h"
#define int long long
#define mii map<int,int>
#define inf 1000000007 //10^9+7
#define for(i,n) for(int i=0;i<n;i++)
#define sort(vec) sort(vec.begin(),vec.end());
#define rever(vec) reverse(vec.begin(),vec.end());
#define unsort(vec) sort(vec); rever(vec);
#define in(a,b,vec,n) a n; cin>>n; vector<b>vec(n);
#define gcd __gcd
using namespace std;

signed main() {
  in(int,string,vec,n);
  vector<int>cnt(n);
  map<int,string>mp;
  mii ma;
  int ans=0;
  for(i,n) {
    cin>>vec.at(i);
    mp[i]=vec.at(i);
  }
  for(i,n) {
    for(j,n) {
      if(vec.at(i)==vec.at(j)) {
        cnt.at(i)++;
      }
    }
    ma[cnt.at(i)]=i;
  }
  unsort(cnt);
  cout<<mp[ma[cnt.at(0)]]<<endl;
}

Submission Info

Judge Result