Submission #3994052
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define uint unsigned int #define llong long long int #define ullong unsigned long long int #define rep(i, n) for (int i = 0; i < n; ++i) const static long long int MOD = 1000000000 + 7; int dy[] = {0, 1, 0, -1}; int dx[] = {1, 0, -1, 0}; const static int MAX_N = 160001; int main() { int n; cin >> n; map<string, int> cand; rep(i, n) { string v; cin >> v; ++cand[v]; } int max_v = -1; string selected; for (auto itr = cand.begin(); itr != cand.end(); ++itr) { if (itr->second >= max_v) { selected = itr->first; max_v = itr->second; } } cout << selected << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | yumarimo |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 758 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 1 ms | 256 KB |
case_02.txt | AC | 1 ms | 256 KB |
case_03.txt | AC | 1 ms | 256 KB |
case_04.txt | AC | 1 ms | 256 KB |
case_05.txt | AC | 1 ms | 256 KB |
case_06.txt | AC | 1 ms | 256 KB |
case_07.txt | AC | 1 ms | 256 KB |
case_08.txt | AC | 1 ms | 256 KB |
case_09.txt | AC | 1 ms | 256 KB |
case_10.txt | AC | 1 ms | 256 KB |
case_11.txt | AC | 1 ms | 256 KB |
case_12.txt | AC | 1 ms | 256 KB |
case_13.txt | AC | 1 ms | 256 KB |
case_14.txt | AC | 1 ms | 256 KB |
case_15.txt | AC | 1 ms | 256 KB |
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |