<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 dp[2004][2004][2];
class Solution {
public:
    int func(vector<int>&arr1, vector<int>&arr2, int i, int j, bool replaced = 0){
        if(i == arr1.size()) return 0;
        if(dp[i][j][replaced] != -1) return dp[i][j][replaced];
        int notreplace = 1e7, replace = 1e7;
        if(replaced){
            if(arr1[i] > arr2[j]) notreplace = func(arr1,arr2,i+1,j,0);
        }
        else{
            if(i == 0 || arr1[i] > arr1[i-1]) notreplace = func(arr1,arr2,i+1,j,0);
        }
        if(i == 0){     // best to replace with arr2[0]
            replace = 1 + func(arr1,arr2,i+1,0,1);
        }
        else{
            int temp = arr1[i-1];
            if(replaced) temp = arr2[j];
            int ub = upper_bound(arr2.begin(),arr2.end(),temp)-arr2.begin();
            if(ub != arr2.size()){
                replace = 1 + func(arr1,arr2,i+1,ub,1);
            }
        }
        return dp[i][j][replaced] = min(notreplace,replace);
    }

    int makeArrayIncreasing(vector<int>& arr1, vector<int>& arr2) {
        set<int>st(arr2.begin(),arr2.end());
        vector<int>temp(st.begin(),st.end());
        memset(dp,-1,sizeof(dp));
        int ans = func(arr1,temp,0,0);
        return ans >= 1e6 ? -1 : ans;
    }
};
38689