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
35
36
37
38
39
40
41
#include <iostream>
#include <vector>
#include <map>

using namespace std;
using ll = long long;

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    ll n, c;
    cin>>n>>c;
    map<ll, ll> mp;
    ll ma = 0;
    ll olda = 0;
    vector<ll> dp(500001);
    while(n--)
    {
        ll a, w;
        cin>>a>>w;
        if(a != olda)
        {
            for(auto [x, y] : mp)
            {
                dp[x] = y;
                ma = max(y, ma);
            }
            mp.clear();
            olda = a;
        }
        mp[w] = max(ma+a-c, max(dp[w]+a, mp[w]));
    }
    for(auto [x, y] : mp)
    {
        dp[x] = y;
        ma = max(y, ma);
    }
    mp.clear();
    cout<<ma<<"\n";
    
}