<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> mc(vector<int>& nums, int k) {
        vector<int> ans;
        int n=nums.size();
        for(int i=0;i<n;i++) {
            while(i<n-k+ans.size() && ans.size()>0 && (*ans.rbegin())<nums[i]) {
                ans.pop_back();
            }
            ans.push_back(nums[i]);
        }
        while(ans.size()>k) ans.pop_back();
        return ans;
    }

    vector<int> mer(vector<int> a, vector<int> b) {
        vector<int> ans;
        int x=0,y=0, n1=a.size(), n2=b.size();
        while(x<n1 && y<n2) {
            if(a[x]>b[y]) {
                ans.push_back(a[x++]);
            }
            else if(a[x]<b[y]) ans.push_back(b[y++]);
            else {
                if(vector<int>(a.begin()+x, a.end()) > vector<int>(b.begin()+y,b.end())) {
                    ans.push_back(a[x++]);
                }
                else ans.push_back(b[y++]);
            }
        }
        while(x<n1) {
            ans.push_back(a[x++]);
        }
        while(y<n2) {
            ans.push_back(b[y++]);
        }
        return ans;
    }

    vector<int> maxNumber(vector<int>& nums1, vector<int>& nums2, int k) {
        int n1=nums1.size(), n2=nums2.size();
        vector<int> ans(k,-1);
        for(int i=0;i<=k;i++) {
            int j=k-i;
            if(i<=n1 && j<=n2) {
                vector<int> v1=mc(nums1,i);
                vector<int> v2=mc(nums2,j);
                ans=max(ans,mer(v1,v2));
            }
        }
        return ans;
    }
};
127382