1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n,c,curr,curr2;
    cin>>n>>c;
    vector<pair<int,int>> v;
    vector<int> wzor(500001,0);
    for(int i=0;i<n;i++)
    {
        cin>>curr>>curr2;
        v.push_back({curr,curr2});
    }
    reverse(v.begin(),v.end());
    vector<long long> dp(n+1);
    dp[0]=0;
    long long pop=0,curr_pop=0;
    for(int i=1;i<=n;i++)
    {
        dp[i]=max(dp[wzor[v[i-1].second]],pop-c)+v[i-1].first;
        wzor[v[i-1].second]=i;
        curr_pop=max(curr_pop,dp[i]);
        if(i!=n)
        {
            if(v[i].first!=v[i-1].first)
            {
                pop=curr_pop;
            }
        }
    }
    cout<<curr_pop;
}