Submission #175841
Source Code Expand
#include <iostream> #include <string> #include <algorithm> using namespace std; int main() { int N; string A[50+10]; cin >> N; for (int i=0;i<N;i++) { cin >> A[i]; } sort(A,A+N); /* for (int i=0;i<N;i++) { cout << A[i] << endl; }*/ int max_num=1; string max_name=A[0]; int cur_num=1; string cur_name=A[0]; for (int i=1;i<N;i++) { if (cur_name == A[i]){ cur_num++; //cout << cur_num << endl; if (max_num < cur_num) { max_name = cur_name; max_num = cur_num; } } else { cur_name = A[i]; cur_num = 1; } } cout << max_name << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 投票 |
User | kazunetakahashi |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 656 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 920 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 | 21 ms | 912 KB |
case_02.txt | AC | 25 ms | 920 KB |
case_03.txt | AC | 23 ms | 916 KB |
case_04.txt | AC | 23 ms | 912 KB |
case_05.txt | AC | 22 ms | 900 KB |
case_06.txt | AC | 21 ms | 904 KB |
case_07.txt | AC | 24 ms | 916 KB |
case_08.txt | AC | 23 ms | 908 KB |
case_09.txt | AC | 24 ms | 912 KB |
case_10.txt | AC | 24 ms | 916 KB |
case_11.txt | AC | 25 ms | 912 KB |
case_12.txt | AC | 22 ms | 908 KB |
case_13.txt | AC | 24 ms | 908 KB |
case_14.txt | AC | 23 ms | 904 KB |
case_15.txt | AC | 25 ms | 860 KB |
sample_01.txt | AC | 27 ms | 864 KB |
sample_02.txt | AC | 23 ms | 820 KB |
sample_03.txt | AC | 22 ms | 900 KB |