<p>Given two integer arrays&nbsp;<code>arr1</code> and <code>arr2</code>, return the minimum number of operations (possibly zero) needed&nbsp;to make <code>arr1</code> strictly increasing.</p>

<p>In one operation, you can choose two indices&nbsp;<code>0 &lt;=&nbsp;i &lt; arr1.length</code>&nbsp;and&nbsp;<code>0 &lt;= j &lt; arr2.length</code>&nbsp;and do the assignment&nbsp;<code>arr1[i] = arr2[j]</code>.</p>

<p>If there is no way to make&nbsp;<code>arr1</code>&nbsp;strictly increasing,&nbsp;return&nbsp;<code>-1</code>.</p>

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

<pre>
<strong>Input:</strong> arr1 = [1,5,3,6,7], arr2 = [1,3,2,4]
<strong>Output:</strong> 1
<strong>Explanation:</strong> Replace <code>5</code> with <code>2</code>, then <code>arr1 = [1, 2, 3, 6, 7]</code>.
</pre>

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

<pre>
<strong>Input:</strong> arr1 = [1,5,3,6,7], arr2 = [4,3,1]
<strong>Output:</strong> 2
<strong>Explanation:</strong> Replace <code>5</code> with <code>3</code> and then replace <code>3</code> with <code>4</code>. <code>arr1 = [1, 3, 4, 6, 7]</code>.
</pre>

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

<pre>
<strong>Input:</strong> arr1 = [1,5,3,6,7], arr2 = [1,6,3,3]
<strong>Output:</strong> -1
<strong>Explanation:</strong> You can&#39;t make <code>arr1</code> strictly increasing.</pre>

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

<ul>
	<li><code>1 &lt;= arr1.length, arr2.length &lt;= 2000</code></li>
	<li><code>0 &lt;= arr1[i], arr2[i] &lt;= 10^9</code></li>
</ul>

<p>&nbsp;</p>

#include <algorithm>

class Solution {

int legt(vector<int>& arr, int v){
    int el=0;
    while(el < arr.size()){
        if(arr[el] > v){ return arr[el]; }
        el++;
    } return -1;
}

vector<int> pushback(vector<int> X, int a){
    vector<int> Y = X; Y.push_back(a); return Y;
}


public:
    int makeArrayIncreasing(vector<int>& arr1, vector<int>& arr2) {
         
        std::sort(arr2.begin(),arr2.end()); //sorts array 2

        std::vector<std::vector<int>> A = {{arr1[0],arr2[0]}}; //create data array, A
        //for (int i = 0; i < 1; i++) { 
        //    std::vector<int> a_i(i+1, -1);
        //    std::vector<std::vector<int>> innerArray(i+2, a_i);
        //    A.push_back(innerArray);
        //}

        for (int i = 1; i < arr1.size(); i++){

            //add to the end of A
            std::vector<int> a_i(i+2, -1);
            A.push_back(a_i);

            if(A[0][0] != -1 && arr1[i] > A[0][0]){ //new top line
                A[1][0] = arr1[i];
            }
            if(A[0][i] != -1 && A[0][i] < arr2[arr2.size()-1] ){ //new bottom line
                A[1][i+1] = legt(arr2, A[0][i]);
            }
            for(int j = 1; j <= i; j++){ //every element in between

                bool leftup = A[0][j-1] != -1 && arr2[arr2.size()-1] > A[0][j-1];
                bool left = A[0][j] != -1 && arr1[i] > A[0][j];

                if( !leftup && left ){ //only left
                    A[1][j] = arr1[i];
                }
                if( leftup && !left ){ //only left up
                    A[1][j] = legt(arr2, A[0][j-1]);
                }
                if( leftup && left ){ //both
                    A[1][j] = ( arr1[i] < legt(arr2, A[0][j-1]) ) ? arr1[i]: legt(arr2, A[0][j-1]) ;
                }

            }

            //Remove first element of A
            A.erase(A.begin());

        }


        for (int i = 0; i <= arr1.size(); i++){
            if(A[0][i] != -1) {return i;}
        } return -1;

    }
};
28884