[C++] 11728 : 배열 합치기

[ 구현 방법 ]

 

[ vector 이용 ]

void Array() {
    int n, m;
    cin >> n >> m;
    vector<int> array;
    for(int i=0; i<n; i++) {
        int input;
        cin >> input;
        array.push_back(input);
    }
    for(int i=0; i<m; i++) {
        int input;
        cin >> input;
        array.push_back(input);
    }
    sort(array.begin(), array.end());
    for(auto a : array) cout << a << " ";
}

 

[ merge sorting ]

void mergeArray() {
    int n, m, check_n = 0, check_m = 0;
    cin >> n >> m;
    int arr_a[n], arr_b[m], arr[n+m];
    for(int i=0; i<n; i++) cin >> arr_a[i];
    for(int i=0; i<m; i++) cin >> arr_b[i];
    
    while(check_n + check_m < n + m) {
        if(check_n == n) cout << arr_b[check_m++] << " ";
        else if(check_m == m) cout << arr_a[check_n++] << " ";
        else{
            if (arr_a[check_n] <= arr_b[check_m])
                cout << arr_a[check_n++] << " ";
            
            else
                cout << arr_b[check_m++] << " ";
            
        }
    }
}