<p>You are given an integer array <code>nums</code>. You want to maximize the number of points you get by performing the following operation any number of times:</p>

<ul>
	<li>Pick any <code>nums[i]</code> and delete it to earn <code>nums[i]</code> points. Afterwards, you must delete <b>every</b> element equal to <code>nums[i] - 1</code> and <strong>every</strong> element equal to <code>nums[i] + 1</code>.</li>
</ul>

<p>Return <em>the <strong>maximum number of points</strong> you can earn by applying the above operation some number of times</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,4,2]
<strong>Output:</strong> 6
<strong>Explanation:</strong> You can perform the following operations:
- Delete 4 to earn 4 points. Consequently, 3 is also deleted. nums = [2].
- Delete 2 to earn 2 points. nums = [].
You earn a total of 6 points.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [2,2,3,3,3,4]
<strong>Output:</strong> 9
<strong>Explanation:</strong> You can perform the following operations:
- Delete a 3 to earn 3 points. All 2&#39;s and 4&#39;s are also deleted. nums = [3,3].
- Delete a 3 again to earn 3 points. nums = [3].
- Delete a 3 once more to earn 3 points. nums = [].
You earn a total of 9 points.</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 2 * 10<sup>4</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
</ul>

class Solution {
public:
    int func(vector<pair<int,int>> &vec,int i, int par,vector<vector<int>> &dp){
        if(i<0) return 0;
        int t=0;
        if(dp[par][i]!=-1)return dp[par][i];
        if(par==0){
            t = max(vec[i].first*vec[i].second +func(vec,i-1,1,dp),func(vec,i-1,0,dp));
        }else{
            if(abs(vec[i].first-vec[i+1].first)==1){
                t = func(vec,i-1,0,dp);
            }else{
                t = max(vec[i].first*vec[i].second +func(vec,i-1,1,dp),func(vec,i-1,0,dp));
            }
        }
        return dp[par][i]=t;
    }
    int deleteAndEarn(vector<int>& nums) {
        vector<pair<int,int>> vec;
        sort(nums.begin(),nums.end());
        int val;
        int i=0;
        while(i<nums.size()){
            int ct=1;
            int val = nums[i];
            while(i<nums.size()-1){
                if(val==nums[i+1]){
                    ct++;
                    i++;
                }else {
                    break;
                }
            }
            vec.push_back({val,ct});
            cout<<val<<" "<<ct<<endl;
            i++;
        }
        vector<vector<int>> dp(2,vector<int>(vec.size(),-1));
        return func(vec,vec.size()-1,0,dp);
    }
};
15941