<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>

void printArr(const vector<int> & arr){
    for(int i = 0 ; i < arr.size() ; i ++) cout<<arr[i]<<" ";
    cout<<endl;
}
void printArr(const vector<vector<int>> & arr){
    for(int i = 0 ; i < arr.size() ; i ++) printArr(arr[i]);
    cout<<endl;
}
void printMap(const unordered_map<int, int> & m){
    for(auto ele = m.begin(); ele != m.end(); ele ++) cout<<ele->first<<":"<<ele->second<<" ";
    cout<<endl;
}
void printArr(const vector<unordered_map<int, int>> & m){
    for(int i = 0 ; i < m.size() ; i ++) printMap(m[i]);
}
class Solution {
public:
    int makeArrayIncreasing(vector<int>& arr1, vector<int>& arr2) {
        int i, j;
        sort(arr2.begin(), arr2.end());
        vector<vector<int>> dp(arr1.size(), vector<int>(arr2.size() + 1, INT_MAX));
        vector<int> b = arr2; b.push_back(arr1[0]);
        sort(b.begin(), b.end());
        for(i = 0 ; i < b.size() ; i ++){
            if(b[i] != arr1[0]) dp[0][i] = 1;
            else dp[0][i] = 0;
        }
        for(i = 1 ; i < dp[0].size() ; i ++) dp[0][i] = min(dp[0][i], dp[0][i - 1]);
        for(i = 1 ; i < dp.size() ; i ++){
            vector<int> c = arr2; c.push_back(arr1[i]);
            sort(c.begin(), c.end());
            for(j = 0 ; j < dp[0].size() ; j ++){
                vector<int>::iterator got = lower_bound(b.begin(), b.end(), c[j]);
                got --;
                int idx = got - b.begin();
                if(idx >= 0 && dp[i - 1][idx] != INT_MAX){
                    if(c[j] != arr1[i]) dp[i][j] = 1 + dp[i - 1][idx];
                    else dp[i][j] = dp[i - 1][idx];
                }
            }
            b = c;
            for(j = 1 ; j < dp[i].size() ; j ++) dp[i][j] = min(dp[i][j - 1], dp[i][j]);
        }
        //cout<<"dp: "<<endl;
        //printArr(dp);
        int ans = INT_MAX;
        for(i = 0 ; i < dp[0].size() ; i ++) ans = min(ans, dp.back()[i]);
        return ans == INT_MAX ? -1 :  ans;
    }
};
119580