Submission #5785690
Source Code Expand
#include<iostream> #include<string> #include<vector> #include<algorithm> using namespace std; int main(){int N; cin >> N; string ans; vector<string> A(N); for(int i = 0 ; i < N; i++){cin >> A[i];} sort(A.begin(),A.end()); int i = 0; int max_cnt = 1; while( i < N){ int cnt = 1; while( i < N && A[i] == A[i+1]){ cnt++; i++;} if( cnt >= max_cnt){ ans = A[i]; max_cnt = cnt;} i++;} cout << ans << endl; return 0;}
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | youyin |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 574 Byte |
Status | RE |
Exec Time | 103 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 | RE | 102 ms | 256 KB |
case_02.txt | RE | 97 ms | 256 KB |
case_03.txt | RE | 97 ms | 256 KB |
case_04.txt | RE | 98 ms | 256 KB |
case_05.txt | RE | 98 ms | 256 KB |
case_06.txt | RE | 98 ms | 256 KB |
case_07.txt | RE | 97 ms | 256 KB |
case_08.txt | RE | 101 ms | 256 KB |
case_09.txt | RE | 97 ms | 256 KB |
case_10.txt | RE | 102 ms | 256 KB |
case_11.txt | RE | 99 ms | 256 KB |
case_12.txt | RE | 96 ms | 256 KB |
case_13.txt | RE | 103 ms | 256 KB |
case_14.txt | RE | 99 ms | 256 KB |
case_15.txt | RE | 96 ms | 256 KB |
sample_01.txt | RE | 98 ms | 256 KB |
sample_02.txt | RE | 97 ms | 256 KB |
sample_03.txt | RE | 96 ms | 256 KB |