<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 solve(int curr, int prevIndex, vector<int>& arr1, vector<int>& arr2, vector<vector<int>>& dp) {
        int n = arr1.size();
        if (curr == n) {
            return 0;
        }
        if (dp[curr][prevIndex + 1] != -1) {
            return dp[curr][prevIndex + 1];
        }
        
        int prevValue = (prevIndex == -1) ? INT_MIN : (prevIndex < n ? arr1[prevIndex] : arr2[prevIndex - n]);
        int minOperations = INT_MAX;
        
        // Case 1: Do not replace the current element
        if (arr1[curr] > prevValue) {
            minOperations = solve(curr + 1, curr, arr1, arr2, dp);
        }
        
        // Case 2: Replace the current element with an element from arr2
        auto it = upper_bound(arr2.begin(), arr2.end(), prevValue);
        if (it != arr2.end()) {
            int replacedIndex = distance(arr2.begin(), it) + n;
            int replacementOperations = solve(curr + 1, replacedIndex, arr1, arr2, dp);
            if (replacementOperations != INT_MAX) {
                minOperations = min(minOperations, 1 + replacementOperations);
            }
        }
        
        return dp[curr][prevIndex + 1] = minOperations;
    }

    int makeArrayIncreasing(vector<int>& arr1, vector<int>& arr2) {
        sort(arr2.begin(), arr2.end());
        int n = arr1.size();
        vector<vector<int>> dp(n, vector<int>(n + arr2.size() + 1, -1));
        
        int result = solve(0, -1, arr1, arr2, dp);
        return result == INT_MAX ? -1 : result;
    }
};

53396