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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#define JOIN_(X, Y) X##Y
#define JOIN(X, Y) JOIN_(X, Y)
#define TMP JOIN(tmp, __LINE__)
#define PB push_back
#define SZ(x) int((x).size())
#define REP(i, n) for (int i = 0, TMP = (n); i < TMP; ++i)
#define FOR(i, a, b) for (int i = (a), TMP = (b); i <= TMP; ++i)
#define FORD(i, a, b) for (int i = (a), TMP = (b); i >= TMP; --i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef unsigned int uint;

const int INF = 1e9 + 9;

struct Result {
    int color;
    ll result;
    ll result_with_color;
};

void apply_pending(ll &best, vector<ll> &best_by_color, const vector<Result> &pending) {

    for (const auto &result : pending) {
        best_by_color[result.color] = max(best_by_color[result.color], result.result_with_color);
        best = max({best, result.result, best_by_color[result.color]});
    }
}

void inline one() {
    int n, penalty;
    cin >> n >> penalty;

    ll best = 0;
    vector<ll> best_by_color(500001);
    int last_size = 0;
    vector<Result> pending;
    REP(i, n) {
        int size, color;
        cin >> size >> color;
        DEB("size=" << size << " color=" << color << "\n");
        if (size > last_size) {
            DEB("apply pending\n");
            apply_pending(best, best_by_color, pending);
            last_size = size;
            pending.clear();
        }
        ll result_with_color =
            max({best_by_color[color], best_by_color[color] + size, best + size - penalty});
        ll result = max({best, best + size - penalty, result_with_color});
        DEB("result=" << result << " result_with_color=" << result_with_color << "\n");
        pending.PB({.color = color, .result = result, .result_with_color = result_with_color});
    }
    apply_pending(best, best_by_color, pending);
    ll bestest = best;
    for (ll x : best_by_color) {
        bestest = max(bestest, x);
    }
    cout << bestest << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // int z; cin >> z; while(z--)
    one();
}