<p>You are given two integer arrays <code>nums1</code> and <code>nums2</code> of lengths <code>m</code> and <code>n</code> respectively. <code>nums1</code> and <code>nums2</code> represent the digits of two numbers. You are also given an integer <code>k</code>.</p>

<p>Create the maximum number of length <code>k &lt;= m + n</code> from digits of the two numbers. The relative order of the digits from the same array must be preserved.</p>

<p>Return an array of the <code>k</code> digits representing the answer.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [3,4,6,5], nums2 = [9,1,2,5,8,3], k = 5
<strong>Output:</strong> [9,8,6,5,3]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [6,7], nums2 = [6,0,4], k = 5
<strong>Output:</strong> [6,7,6,0,4]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [3,9], nums2 = [8,9], k = 3
<strong>Output:</strong> [9,8,9]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>m == nums1.length</code></li>
	<li><code>n == nums2.length</code></li>
	<li><code>1 &lt;= m, n &lt;= 500</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 9</code></li>
	<li><code>1 &lt;= k &lt;= m + n</code></li>
</ul>

class Solution {
public:
    vector<int> solve(int len, vector<int> nums) {
        int n = nums.size();
        vector<int> st;
        int to_remove = n - len;
        for (int i = 0; i < n; i++) {
            while (st.size() > 0 && to_remove > 0 && st.back() < nums[i]) {
                st.pop_back();
                to_remove--;
            }
            st.push_back(nums[i]);
        }
        while (to_remove > 0) {
            st.pop_back();
            to_remove--;
        }
        return st;
    }
   vector<int> merge(vector<int> temp1, vector<int> temp2) {
    int n = temp1.size();
    int m = temp2.size();
    int i = 0, j = 0;
    vector<int> temp;

    while (i < n && j < m) {
        if (temp1[i] > temp2[j]) {
            temp.push_back(temp1[i]);
            i++;
        } else if (temp1[i] < temp2[j]) {
            temp.push_back(temp2[j]);
            j++;
        } else {
            // Compare remaining parts of temp1 and temp2
            if (vector<int>(temp1.begin() + i, temp1.end()) > vector<int>(temp2.begin() + j, temp2.end())) {
                temp.push_back(temp1[i]);
                i++;
            } else {
                temp.push_back(temp2[j]);
                j++;
            }
        }
    }

    while (i < n) {
        temp.push_back(temp1[i]);
        i++;
    }

    while (j < m) {
        temp.push_back(temp2[j]);
        j++;
    }

    return temp;
}


    vector<int> maxNumber(vector<int>& nums1, vector<int>& nums2, int k) {
        vector<int> ans(k, 0);
        int m = nums1.size();
        int n = nums2.size();
        for (int i = 0; i <= k; i++) {
            int x = i;
            int y = k - i;
            if (x <= m && y <= n) {
                vector<int> temp1 = solve(i, nums1);
                vector<int> temp2 = solve(k - i, nums2);

                vector<int> temp = merge(temp1, temp2);
                if (ans < temp) {
                    ans = temp;
                }
            }
        }
        return ans;
    }
};
131797