해커랭크(HackerRank)
Migratory Birds
cepiloth
2018. 8. 19. 17:36
반응형
1. 문제
2. 알고리즘
키워드 - 구현
3. 코드
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 | #include <bits/stdc++.h> using namespace std; int migratoryBirds(int n, vector <int> ar) { // Complete this function int brr[6] = {0,}; const int size = ar.size(); for(int i = 0; i < size; i ++) { brr[ar[i]]++; } int result = 1; int max = 0; for(int i = 1; i <= 5; i ++) { if(max < brr[i]) { max = brr[i]; result = i; } } return result; } int main() { int n; cin >> n; vector<int> ar(n); for(int ar_i = 0; ar_i < n; ar_i++){ cin >> ar[ar_i]; } int result = migratoryBirds(n, ar); cout << result << endl; return 0; } | cs |
반응형