Submission #168885


Source Code Expand

#define _GLIBCXX_DEBUG

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <sstream>
#include <functional>
#include <cmath>

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define numof(array) (sizeof (array) / sizeof *(array))

using namespace std;

int n;
map<string, int> elect;
vector<string> order;
int ans = 0;
string output;

void solve()
{
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		string test;
		cin >> test;
		elect[test]++;
		order.push_back(test);
	}
	for (int i = 0; i < elect.size(); i++)
	{
		if (elect[order[i]]>ans)
			output = order[i];
	}
	cout << output << endl;
}

int main(void)
{
	solve();
	return 0;
}

Submission Info

Submission Time
Task B - 投票
User boomx
Language C++ (G++ 4.6.4)
Score 0
Code Size 850 Byte
Status WA
Exec Time 21 ms
Memory 932 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
AC × 14
WA × 4
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 21 ms 800 KB
case_02.txt AC 21 ms 932 KB
case_03.txt AC 21 ms 804 KB
case_04.txt AC 21 ms 928 KB
case_05.txt AC 21 ms 928 KB
case_06.txt WA 21 ms 932 KB
case_07.txt AC 21 ms 800 KB
case_08.txt WA 21 ms 928 KB
case_09.txt AC 21 ms 928 KB
case_10.txt AC 21 ms 800 KB
case_11.txt WA 21 ms 924 KB
case_12.txt AC 21 ms 924 KB
case_13.txt AC 21 ms 928 KB
case_14.txt AC 21 ms 848 KB
case_15.txt WA 21 ms 932 KB
sample_01.txt AC 21 ms 932 KB
sample_02.txt AC 21 ms 928 KB
sample_03.txt AC 21 ms 800 KB