Submission #1588445
Source Code Expand
#include <bits/stdc++.h> #define REP(i, n) for(int i = 0; i < (int)(n); ++i) #define FOR(i, m, n) for(int i = (m); i < (int)(n); ++i) #define ALL(x) (x).begin(), (x).end() #define INF 2000000000 #ifdef LOCAL #define eprintf(...) fprintf(stderr, __VA_ARGS__) #else #define eprintf(...) 0 #endif using namespace std; typedef long long LL; typedef unsigned long long ULL; typedef unsigned int uint; int main() { int n; cin >> n; map<string, int> mp; REP(i, n) { string name; cin >> name; mp[name]++; } int num = -1; string winner; for(auto m : mp) { if(num < m.second) { num = m.second; winner = m.first; } } cout << winner << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | yoshi_k |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 746 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 |