Submission #1520381
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <map> #include <utility> using namespace std; int main() { int n, max = 0; string s, ans; map<string, int> m; pair<string, int> p; cin >> n; for (int i = 0; i < n; i++) { cin >> s; m[s]++; } map<string, int> ::iterator itr; for (itr = m.begin(); itr != m.end(); itr++) { if (max < itr -> second) { max = itr -> second; ans = itr -> first; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - アルバム |
User | RedHerring |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 520 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.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 | WA | 1 ms | 256 KB |
case_02.txt | WA | 1 ms | 256 KB |
case_03.txt | WA | 1 ms | 256 KB |
case_04.txt | WA | 1 ms | 256 KB |
case_05.txt | WA | 1 ms | 256 KB |
case_06.txt | WA | 1 ms | 256 KB |
case_07.txt | WA | 1 ms | 256 KB |
case_08.txt | WA | 1 ms | 256 KB |
case_09.txt | AC | 1 ms | 256 KB |
case_10.txt | WA | 1 ms | 256 KB |
case_11.txt | WA | 1 ms | 256 KB |
case_12.txt | WA | 1 ms | 256 KB |
case_13.txt | WA | 1 ms | 256 KB |
case_14.txt | WA | 1 ms | 256 KB |
case_15.txt | WA | 1 ms | 256 KB |
sample_01.txt | WA | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |