<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 makeArrayIncreasing(vector<int>& arr1, vector<int>& arr2) {
        unordered_map<int,int>map;
        unordered_map<int,int>newmap;

        sort(arr2.begin(),arr2.end());

        map[arr1[0]] = 0;
        
        if(arr2[0] != arr1[0]){
            map[arr2[0]] = 1;
        }

        for(int i = 1;i < arr1.size();i++){

            // cout << "new" << endl;
            for(auto entry : map){
                
                int key = entry.first;
                int value = entry.second;

                // cout << "key = " << key << endl;
                // cout << "value = " << value << endl;

                if(arr1[i] > key){

                    // cout << "key " << endl;
                    if(newmap.find(arr1[i]) != newmap.end())
                        newmap[arr1[i]] = min(newmap[arr1[i]],value);
                    else newmap[arr1[i]] = value;
                }

                auto j = upper_bound(arr2.begin(),arr2.end(),key);
                int index = j - arr2.begin();
                if(index < arr2.size()){
                    int curr_key = arr2[index];

                    if(curr_key != arr1[i]){
                        if(newmap.find(curr_key) != newmap.end())
                            newmap[curr_key] = min(newmap[curr_key],value + 1);
                        else newmap[curr_key] = value + 1;
                    }
                }
            }
            map.clear();
            map = newmap;
            newmap.clear();

            if(map.size() == 0) return -1;
        }

        int mini = INT_MAX;
        for(auto entry : map){
            
            // cout << "key = " << entry.first << endl;
            // cout << "value = " << entry.second << endl;


            mini = min(mini,entry.second);
        }

        return mini;
    }
};
85263