Submission #1026002
Source Code Expand
#include <bits/stdc++.h> #define REP(i,n) for(int i=0; i<(int)(n); ++i) #define RREP(i,n) for(int i=(int)(n); i>=0; --i) #define FOR(i,k,n) for(int i=(k);i<(int)(n);++i) typedef long long int ll; using namespace std; int main(void) { int N; cin >> N; map<string, int> S; REP(i, N) { string s; cin >> s; S[s]++; } string name; int ans = 0; for(map<string, int>::iterator it = S.begin(); it != S.end(); ++it) { if(it->second > ans) { ans = it->second; name = it->first; } } cout << name << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | kivantium |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 628 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 928 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 | 19 ms | 796 KB |
case_02.txt | AC | 18 ms | 792 KB |
case_03.txt | AC | 18 ms | 796 KB |
case_04.txt | AC | 19 ms | 924 KB |
case_05.txt | AC | 18 ms | 920 KB |
case_06.txt | AC | 18 ms | 912 KB |
case_07.txt | AC | 18 ms | 796 KB |
case_08.txt | AC | 19 ms | 796 KB |
case_09.txt | AC | 17 ms | 800 KB |
case_10.txt | AC | 19 ms | 796 KB |
case_11.txt | AC | 17 ms | 800 KB |
case_12.txt | AC | 18 ms | 796 KB |
case_13.txt | AC | 19 ms | 800 KB |
case_14.txt | AC | 18 ms | 928 KB |
case_15.txt | AC | 19 ms | 800 KB |
sample_01.txt | AC | 18 ms | 796 KB |
sample_02.txt | AC | 19 ms | 792 KB |
sample_03.txt | AC | 19 ms | 800 KB |