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
#include <bits/stdc++.h>


using namespace std;


long long solve(int n, int c, vector <int> &a, vector <int> &color) {
    int maxColor = *max_element(color.begin(), color.end());

    vector <long long> dp(n, 0), dpColor(maxColor + 1, 0);
    long long dpAny = 0;

    int iPrev = 0;
    for (int i = 0; i < n; i++) {
        dp[i] = max(dpAny + a[i] - c, dpColor[color[i]] + a[i]);

        if (i == n - 1 || a[i + 1] != a[i]) {
            while (iPrev <= i) {
                dpColor[color[iPrev]] = max(dpColor[color[iPrev]], dp[iPrev]);
                dpAny = max(dpAny, dp[iPrev]);

                iPrev++;
            }
        }
    }

    return dpAny;
}

int main() {
    ios_base::sync_with_stdio(false);

    int n, c;
    cin >> n >> c;

    vector <int> a(n), color(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> color[i];
        color[i]--;
    }

    cout << solve(n, c, a, color);

    return 0;
}