#include <vector>
#include <iostream>
#include <algorithm>

void merge(std::vector<int>& nums1, int m, std::vector<int>& nums2, int n) {
    int total = m + n;
    while (n > 0) {
        nums1[m++] = nums2[--n];
    }
    std::sort(nums1.begin(), nums1.end());
}

int main() {
    std::cout << "Expected: [1, 2, 2, 3, 5, 6]" << std::endl;
    std::vector<int> n1 = {1, 2, 3, 0, 0, 0};
    std::vector<int> n2 = {2, 5, 6};
    merge(n1, 3, n2, 3);
    std::cout << "Got: [ ";
    for (int i = 0; i < 6; i++) {
        std::cout << n1[i] << " ";
    }
    std::cout << " ]" << std::endl;
    return 0;
}