Submission #168880

---

Source Code Expand

#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#define MINF 0xc0c0c0c0
 
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#include <list>
#include <cctype>
#include <utility>
 
using namespace std;
 
typedef long long ll;
typedef pair <int,int> P;
typedef pair <int,P> PP;
 
static const double EPS = 1e-8;
 
int tx[] = {0,1,0,-1};
int ty[] = {-1,0,1,0};

int main(){
  int N;
  map<string,int> vote;
  int max_v = 0;
  while(~scanf("%d",&N)){
    string res = "";
    for(int i=0;i<N;i++){
      string name;
      cin >> name;
      vote[name]++;
      if(vote[name] > max_v){
	res = name;
	max_v = vote[name];
      }
    }
    cout << res << endl;
  }
}

Submission Info

Judge Result