<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:
    map<string, int> mp;
    int solve(vector<int>& arr1, vector<int>& arr3, int prev, int i) {
        if (i == arr1.size())
            return 0;
        string key = to_string(i) + "_" + to_string(prev);
        if (mp.find(key) != mp.end())
            return mp[key];
        int result1 = 1e9 + 1;
        if (arr1[i] > prev)
            result1 = solve(arr1, arr3, arr1[i], i + 1);
        int result2 = 1e9 + 1;
        auto it = upper_bound(arr3.begin(), arr3.end(), prev);
        if (it != arr3.end()) {
            int index = it - arr3.begin();
            result2 = 1 + solve(arr1, arr3, arr3[index], i + 1);
        }

        return mp[key] = min(result1, result2);
    }
    int makeArrayIncreasing(vector<int>& arr1, vector<int>& arr2) {
        sort(arr2.begin(), arr2.end());
        /*set<int> st;
        for (auto it : arr2)
            st.insert(it);
        vector<int> arr3;
        for (auto it : st)
            arr3.push_back(it);
    */
        int ans = solve(arr1, arr2, INT_MIN, 0);
        if (ans == 1e9 + 1)
            return -1;
        return ans;
    }
};
122031