Submission #168678


Source Code Expand

Copy
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cstdio>
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define RREP(i,x) for(int i=(x);i>=0;i--)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i)

int n;
main(){
	string s;
	map<string, int> ss;
	cin >> n;
	REP(i, n){
		cin >> s;
		ss[s] ++;
	}
	pair<int, string> m(0, "");
	FOR(it, ss){
		m = max(m, pair<int, string>(it->second, it->first));
	}
	cout << m.second << endl;
	return 0;
}

Submission Info

Submission Time
Task B - 投票
User zerokugi
Language C++ (G++ 4.6.4)
Score 100
Code Size 769 Byte
Status AC
Exec Time 25 ms
Memory 928 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 23 ms 792 KB
case_02.txt AC 23 ms 800 KB
case_03.txt AC 24 ms 804 KB
case_04.txt AC 22 ms 920 KB
case_05.txt AC 25 ms 928 KB
case_06.txt AC 23 ms 804 KB
case_07.txt AC 22 ms 920 KB
case_08.txt AC 23 ms 800 KB
case_09.txt AC 25 ms 796 KB
case_10.txt AC 24 ms 928 KB
case_11.txt AC 22 ms 792 KB
case_12.txt AC 21 ms 924 KB
case_13.txt AC 22 ms 792 KB
case_14.txt AC 22 ms 796 KB
case_15.txt AC 22 ms 800 KB
sample_01.txt AC 20 ms 928 KB
sample_02.txt AC 24 ms 920 KB
sample_03.txt AC 23 ms 804 KB