Submission #168955


Source Code Expand

Copy
#include <iostream>
#include <algorithm>
#include <string>
#include <unordered_map>
using namespace std;
int main(){
	int n;
	cin>>n;
	unordered_map<string,int> names;
	for (int i = 0; i < n; i++) {
		string s;
		cin>>s;
		names[s]++;
	}
	int maximum = 0;
	string max_name;
	for (auto i = names.begin(); i != names.end(); ++i) {
		if(maximum<(i->second))max_name = (i->first),maximum = (i->second);
	}
	cout<<max_name<<endl;
	return 0;
}

Submission Info

Submission Time
Task B - 投票
User C01L
Language C++11 (GCC 4.8.1)
Score 100
Code Size 460 Byte
Status AC
Exec Time 24 ms
Memory 920 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 21 ms 796 KB
case_02.txt AC 22 ms 916 KB
case_03.txt AC 22 ms 808 KB
case_04.txt AC 20 ms 912 KB
case_05.txt AC 22 ms 916 KB
case_06.txt AC 21 ms 920 KB
case_07.txt AC 21 ms 912 KB
case_08.txt AC 21 ms 920 KB
case_09.txt AC 24 ms 796 KB
case_10.txt AC 19 ms 916 KB
case_11.txt AC 22 ms 792 KB
case_12.txt AC 21 ms 796 KB
case_13.txt AC 22 ms 912 KB
case_14.txt AC 21 ms 916 KB
case_15.txt AC 22 ms 796 KB
sample_01.txt AC 21 ms 720 KB
sample_02.txt AC 22 ms 792 KB
sample_03.txt AC 20 ms 912 KB