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

int search(vector<int>& arr2,int prev){
    int low=0;
    int high=arr2.size()-1;
    int ans=-1;
    while(low<=high){
        int mid=low+(high-low)/2;
       if(arr2[mid]>prev){
        ans=arr2[mid];
        high=mid-1;
       }
       else{
        low=mid+1;
       }
    }
    return ans;
}
int solve(vector<int>& arr1, vector<int>& arr2,int i,int prev,map<pair<int,int>,int> &dp){
    if(i==arr1.size()) return 0;

    if(dp.find({i,prev})!=dp.end()) return dp[{i,prev}];

    
    int x=1e9;
    int y=1e9;
    int z=1e9;

    if(arr1[i]<=prev){
        int value=search(arr2,prev);
        if(value>prev){
           x=1+solve(arr1,arr2,i+1,value,dp);
          
        }
    }

    else{
          y=solve(arr1,arr2,i+1,arr1[i],dp);
        int v2=search(arr2,prev);
        if(v2>prev){
             z=1+solve(arr1,arr2,i+1,v2,dp);
        }
    }
   return  dp[{i,prev}]=min(x,min(y,z));
}
class Solution {
public:
    int makeArrayIncreasing(vector<int>& arr1, vector<int>& arr2) {
        sort(arr2.begin(),arr2.end());
        map<pair<int,int>,int> dp;
        int ans= solve(arr1,arr2,0,-1,dp);
       
        if(ans==1e9) return -1;
        else return ans;
    }
};
99970