<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 dp[2010][2010];

    int rec(int level,int prev, vector<int>&arr1,vector<int>&arr2){
      
        if(level == arr1.size())return 0;
        if(dp[level][prev] != -1)return dp[level][prev];

        int ans = 1e9 ;
        int prevnum = 0;

        if(prev == 0){
            prevnum = arr1[level-1];
        }
        else{
            prevnum = arr2[prev-1];
        }
          if(arr1[level] > prevnum){
            ans = min(ans,rec(level+1,0,arr1,arr2));
          }
          int idx = upper_bound(arr2.begin(),arr2.end(),prevnum)-arr2.begin();
          if(idx < arr2.size())ans = min(ans,1+rec(level+1,idx+1,arr1,arr2));

          return dp[level][prev] = ans;
    }

    int makeArrayIncreasing(vector<int>& arr1, vector<int>& arr2) {
          memset(dp,-1,sizeof(dp));
          int ans = 1e9 ;
          set<int>st;
          for(auto x : arr2)st.insert(x);
          arr2.clear();
          for(auto x : st )arr2.push_back(x);


          ans = rec(1,0,arr1,arr2);
          for(int j =0 ; j<arr2.size(); j++){
            ans = min(ans,1+rec(1,j+1,arr1,arr2));
          }
          if(ans == 1e9)return -1 ;
          else return ans ;
    }
};
26433