Migratory Birds

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#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;
}