Submission #168880


Source Code Expand

Copy
#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

Submission Time
Task B - 投票
User okaoka
Language C++ (G++ 4.6.4)
Score 100
Code Size 929 Byte
Status AC
Exec Time 23 ms
Memory 932 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 18
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, case_01.txt, case_02.txt, case_03.txt, case_04.txt, case_05.txt, case_06.txt, case_07.txt, case_08.txt, case_09.txt, case_10.txt, case_11.txt, case_12.txt, case_13.txt, case_14.txt, case_15.txt
Case Name Status Exec Time Memory
case_01.txt AC 22 ms 800 KB
case_02.txt AC 22 ms 928 KB
case_03.txt AC 21 ms 812 KB
case_04.txt AC 21 ms 924 KB
case_05.txt AC 21 ms 796 KB
case_06.txt AC 22 ms 800 KB
case_07.txt AC 21 ms 928 KB
case_08.txt AC 22 ms 800 KB
case_09.txt AC 21 ms 924 KB
case_10.txt AC 21 ms 924 KB
case_11.txt AC 23 ms 800 KB
case_12.txt AC 22 ms 924 KB
case_13.txt AC 21 ms 920 KB
case_14.txt AC 22 ms 800 KB
case_15.txt AC 21 ms 676 KB
sample_01.txt AC 21 ms 676 KB
sample_02.txt AC 21 ms 932 KB
sample_03.txt AC 21 ms 928 KB