#include <iostream>
#include <cmath>
#include <unistd.h>

using namespace std;

int* merge (int* left, int* right, int ln, int rn){
    int* arr = new int [ln+rn];
    int l=0, r=0, k=0;
    while (l<ln && r<rn) {
        if (left[l] <= right[r]){
            arr[k] = left[l];
            l++; k++;
        }
        else {
            arr[k] = right[r];
            r++; k++;
        }
    }
    while (l < ln){
        arr[k] = left[l];
        l++; k++;
    }
    while (r < rn){
        arr[k] = right[r];
        r++; k++;
    }
    return arr;
}

void print(int somearr[], int n) {
    for (int i = 0; i < n; i++) {
        cout << somearr[i] << " ";
    }
    cout << endl;
}

int main(){
    int left_arr[3];
    left_arr[0] = 10;
    left_arr[1] = 12;
    left_arr[2] = 17;
    int right_arr[5];
    right_arr[0] = 0;
    right_arr[1] = 1;
    right_arr[2] = 11;
    right_arr[3] = 18;
    right_arr[4] = 20;
    print(left_arr, 3);
    print(right_arr, 5);
    int * result = merge(left_arr, right_arr, 3, 5);
    print(result, 8);
   return 0;
}