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

class Solution {
public:
    int makeArrayIncreasing(vector<int>& arr1, vector<int>& arr2) {
        sort(arr2.begin(),arr2.end());
        int n = arr1.size();
        int m = arr1.size()+2;
        vector<vector<int>>dp(n,vector<int>(m,-1));
        dp[0][0] = arr1[0];
        dp[0][1] = arr2[0];
        for(int i = 1 ; i<n ; i++){
            for(int j = 0 ; j<m ; j++){
                if(j==0){
                    if(dp[i-1][j]!=-1 && arr1[i]>dp[i-1][j]) 
                        dp[i][j] = arr1[i];
                }
                else{
                    if(dp[i-1][j-1]==-1 && dp[i-1][j]!=-1){
                        if(arr1[i]>dp[i-1][j])
                           dp[i][j] = arr1[i];
                    }
                    else if(dp[i-1][j-1]!=-1 && dp[i-1][j]==-1){
                        auto it = upper_bound(arr2.begin(),arr2.end(),dp[i-1][j-1]);
                        if(it!=arr2.end())
                           dp[i][j] = *it;
                    }
                    else if(dp[i-1][j-1]!=-1 && dp[i-1][j]!=-1){
                        int a = 1e9, b = 1e9;
                        auto it = upper_bound(arr2.begin(),arr2.end(),dp[i-1][j-1]);
                        if(it!=arr2.end())a = *it;
                        if(arr1[i]>dp[i-1][j])b = arr1[i];
                        dp[i][j] = (min(a,b)!=1e9)?min(a,b):-1;
                    }
                }
            }
        }
        int ind = -1;
        for(int i = 0 ; i<m ; i++){
            if(dp[n-1][i]!=-1){
                ind = i;
                break;
            }
        }
        // for(int i = 0 ; i<n ; i++){
        //     for(int j = 0 ; j<m ; j++){
        //         cout<<dp[i][j]<<" ";
        //     }
        //     cout<<endl;
        // }
        return ind;
    }
};
31335