const int n(5), m(6);
int A[n] = { 1, 2, 4, 5, 5 };
int B[m] = { 0, 3, 4, 5, 6, 7};
int iA(0), iB(0), iC(0);

int C[n + m] = { 0 };
while (iA < n && iB < m)
    if (A[iA] < B[iB])
        C[iC++] = A[iA++];
    else
        C[iC++] = B[iB++];

for (int i(iA); i < n; ++i)
    C[iC++] = A[i];

for (int i(iB); i < m; ++i)
    C[iC++] = B[i];

for (int i(0); i < n + m; ++i)
    cout << C[i] << ' ';