<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:

    void printEle(vector<int> d)
    {
        for(int x : d) cout << x << " ";

        cout << endl;
    }

    bool checkFirst(vector<int>& d1, vector<int>& d2, int a, int b)
    {
        int n1 = d1.size();
        int n2 = d2.size();

        while(a < n1 && b < n2) {
            if(d1[a] > d2[b]) return true;
            if(d1[a] < d2[b]) return false;
            a++;
            b++;
        }

        return (n1 - a) > 0;
    }

    vector<int> getElement(vector<int>& nums2, int l)
    {
        deque<int> q2;
        vector<int> ret;

        int n2 = nums2.size();

        for(int i = 0; i < n2; i++) {
            while(!q2.empty() && (n2 - i + q2.size()) > l && q2.back() < nums2[i])q2.pop_back();
            q2.push_back(nums2[i]);
        }

        while(q2.size() > l) {
          //  cout << q2.front() << " ";
            q2.pop_back();
        }

        while(!q2.empty()) {
            ret.push_back(q2.front());
            q2.pop_front();
        }

       // cout << ret.size() << endl;
       // printEle(q2);

        return ret;
    }
    vector<int> maxNumber(vector<int>& nums1, vector<int>& nums2, int k) {

        int n1 = nums1.size();
        int n2 = nums2.size();

        vector<int> ans(k, 0);

       // getElement(nums1, 1);

        for(int i = 0; i <= k && i <= n1; i++) {

            auto q1 = getElement(nums1, i);
           // printEle(q1);
            if(k - i > n2) continue;
            auto q2 = getElement(nums2, k - i);
            //printEle(q2);
            int a = 0, b = 0;

           // cout << q1.size() << " " << q2.size() << endl;

            vector<int> ret;
            while(a < q1.size() && b < q2.size()) {
                bool isFirst = checkFirst(q1, q2, a, b);
                if(isFirst) {
                    ret.push_back(q1[a++]);
                } else ret.push_back(q2[b++]);
            }

           // cout << a << " " << b << endl;

            while(a < q1.size()) ret.push_back(q1[a++]);
            while(b < q2.size()) ret.push_back(q2[b++]);

            printEle(ret);

            for(int j = 0; j < k; j++) {
                if(ans[j] < ret[j]){
                    ans = ret;
                    break;
                } else if(ans[j] > ret[j]) break;
            }

        }

        return ans;
    }
};
52327