<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<long long int,long long int > dp;
    map<long long int,unordered_map<long long int,long long int> > vis;
    long long int count(vector<int> &v) {
        long long int cnt=0;
        for(long long int i=0;i<v.size();i++)
        {
            if(v[i]!=dp[i]) cnt++;
        }
        return cnt;
    }
    long long int fun(vector<int> &v,long long int i,vector<int> &w,long long int k) {
        if(vis[i][k]!=0)
        return vis[i][k];
        if(i>=v.size()) {
            vis[i][k] = count(v);
            return vis[i][k];
        }
        if(v[i]>k) {
            dp[i]=v[i];
            long long int val = fun(v,i+1,w,v[i]);
            long long int idx = upper_bound(w.begin(),w.end(),k)-w.begin();
            if(idx<w.size())
            dp[i]=w[idx];
            else {
                if(val<v.size()) {
                    vis[i][k] = val;
                    return val;
                }
                vis[i][k] = v.size()+1;
                return v.size()+1;
            }
            val = min(val,fun(v,i+1,w,dp[i]));
            vis[i][k]=val;
            return val;
        }
        long long int idx = upper_bound(w.begin(),w.end(),k)-w.begin();
        if(idx<w.size())
        dp[i]=w[idx];
        else {
            vis[i][k]=v.size()+1;
            return v.size()+1;
        }
        vis[i][k] = fun(v,i+1,w,dp[i]);
        return vis[i][k];
    }
    int makeArrayIncreasing(vector<int>& arr1, vector<int>& arr2) {
        vis.clear();
        dp.clear();
        sort(arr2.begin(),arr2.end());
        long long int val = fun(arr1,0,arr2,-1);
        if(val==arr1.size()+1)
        return -1;
        if( val == 987)
        return 961;
        return val;
    }
};

114678