#include <iostream>
#include <vector>
using namespace std;
class Solution
{
public:
void merge(vector<int>& num1, int m, vector<int>& num2, int n);
};
void Solution::merge(vector<int>& num1, int m, vector<int>& num2, int n)
{
int i = m - 1;
int j = n - 1;
int k = m + n - 1;
while (i >= 0 && j >= 0)
{
if (num1[i] > num2[j])
{
num1[k--] = num1[i--];
}
else
{
num1[k--] = num2[j--];
}
}
while (j >= 0)
{
num1[k--] = num2[j--];
}
}
int main()
{
vector<int> num1 = { 1, 2, 3, 0, 0, 0 };
int m = 3;
vector<int> num2 = { 2, 5, 6 };
int n = 3;
Solution sol;
sol.merge(num1, m, num2, n);
for (int num : num1)
{
cout << num << " ";
}
cout << endl;
return 0;
}