Submission #169923


Source Code Expand

Copy
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <istream>
#include <sstream>
#include <iomanip>
#include <iterator>
#include <climits>
using namespace std;

typedef ostringstream OSS;
typedef istringstream ISS;

typedef vector<int> VI;
typedef vector< VI > VVI;

typedef long long LL;

typedef pair<int, int> PII;
typedef vector<PII> VPII;

#define X first
#define Y second

int main(void) {
	int N;
	cin >> N;
	map<string, int> cnts;
	for (int i = 0; i < N; i++) {
		string name;
		cin >> name;
		cnts[name] = cnts.count(name) ? cnts[name] + 1 : 1;
	}

	cout << (*max_element(cnts.begin(), cnts.end(), [](pair<string, int> a, pair<string, int> b){ return a.second < b.second; })).first << endl;

	return 0;
}

Submission Info

Submission Time
Task B - 投票
User snakazawa
Language C++11 (GCC 4.8.1)
Score 100
Code Size 912 Byte
Status AC
Exec Time 21 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 20 ms 796 KB
case_02.txt AC 21 ms 804 KB
case_03.txt AC 21 ms 924 KB
case_04.txt AC 20 ms 924 KB
case_05.txt AC 20 ms 920 KB
case_06.txt AC 21 ms 804 KB
case_07.txt AC 21 ms 924 KB
case_08.txt AC 20 ms 924 KB
case_09.txt AC 21 ms 924 KB
case_10.txt AC 20 ms 920 KB
case_11.txt AC 21 ms 924 KB
case_12.txt AC 21 ms 752 KB
case_13.txt AC 21 ms 928 KB
case_14.txt AC 21 ms 924 KB
case_15.txt AC 21 ms 800 KB
sample_01.txt AC 21 ms 928 KB
sample_02.txt AC 21 ms 920 KB
sample_03.txt AC 21 ms 748 KB