<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>merge(vector<int>&v1,vector<int>&v2,int k){
        vector<int>ans;
        for(int i=0;i<k;i++){
            vector<int>temp=max(v1,v2);
            
            if(v1>v2){
                v1.erase(v1.begin());
            }
            else{
                v2.erase(v2.begin());
            }
            ans.push_back(temp.front());
        }
        return ans;
    }
    vector<int> getIncreasingArrayOfKdigit(vector<int>& nums, int del) {
        int n= nums.size();
        stack<int> st;
        for (int i = 0; i < n; i++) {
            if (st.empty())
                st.push(nums[i]);
            else {
                while (!st.empty() && nums[i] > st.top() && del > 0) {
                    st.pop();
                    del--;
                }
                st.push(nums[i]);
            }
        }
       while(del>0){
         st.pop();
         del--;
       }
        vector<int>ans;
        while(!st.empty()){
            ans.push_back(st.top());;
            st.pop();
        }
        reverse(ans.begin(),ans.end());;
        return ans;

    }
    vector<int> maxNumber(vector<int>& nums1, vector<int>& nums2, int k) {
        int m = nums1.size(), n = nums2.size();
        vector<int> ans;
       
        for (int i = 0; i <= k; i++) {
            int a = i, b = k - i;
            int del1 = m - a;
            int del2 = n - b;
            if (a > m || b > n)
                continue;
            vector<int>v1= getIncreasingArrayOfKdigit(nums1,del1);
            vector<int>v2= getIncreasingArrayOfKdigit(nums2,del2);

            vector<int>temp=merge(v1,v2,k);
            ans=max(ans,temp);
        }
        return ans;
    }
};
242172