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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define ll long long
#define dbg(x) cerr << #x << ": " << x << "\n"
#define mp make_pair

using namespace std;

const int N = 500005;
const ll inf = 1e18;
int A[N];
int W[N];
ll cur_dp[N];
ll dp[N];
ll res[N];

int main()
{
    int n, c;
    cin >> n >> c;

    for (int i = 1; i <= n; i++)
    {
        cin >> A[i];
        cin >> W[i];
    }

    vector<int> cur_colors;

    ll maxi = 0;

    for (int i = n; i >= 1; i--)
    {
        cur_dp[W[i]] = max({cur_dp[W[i]], maxi + A[i] - c, dp[W[i]] + A[i]});
        cur_colors.pb(W[i]);
        if (i == 1 || A[i - 1] != A[i])
        {
            for (int color : cur_colors)
            {
                dp[color] = max(dp[color], cur_dp[color]);
                maxi = max(maxi, dp[color]);
                cur_dp[color] = dp[color];
            }
            cur_colors.clear();
        }
    }

    ll res = 0;
    for (int i = 1; i < N; i++)
        res = max(res, dp[i]);
    cout << res;

    return 0;
}