Submission #2174007
Source Code Expand
#include <stdio.h> #include <iostream> #include <vector> #include <algorithm> #include <utility> #include <map> using namespace std; #ifdef DEBUG #define D(x) x #else #define D(x) x #endif #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define REP(i, n) for(int i = 0; i < (n); ++i) int main(){ int n; cin >> n; map<string,int> s; REP(i , n ){ string name; cin >> name; s[ name ] = s[name] + 1; } int maxcnt = -1; string cand; for( auto& p : s ){ if( maxcnt < p.second ){ cand = p.first; maxcnt = p.second; } } cout << cand << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | lisosia |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 609 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 |