Submission #1624914
Source Code Expand
#include<iostream> #include<map> using namespace std;; int main(){ int n,maxi = -1; cin >> n; string tmp,name; map<string,int> m; map<string,int>::iterator ite; for(int i = 0;i < n;i++){ cin >> tmp; ite = m.find(tmp); if(ite == m.end()){ m.insert(make_pair(tmp,1)); if(maxi < 1){ name = tmp; maxi = 1; } }else{ ite->second++; if(ite->second >= maxi){ name = ite->first; } } } cout << name << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | punipuni |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 643 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, 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 | WA | 1 ms | 256 KB |
case_09.txt | WA | 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 | WA | 1 ms | 256 KB |
case_15.txt | WA | 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 |