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

#define ll long long

ll dp[500007]; // najlepszy wynik kończący się tym kolorem

map<ll, set<int>> klocki;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    int n;
    ll c;
    cin >> n >> c;

    for (int i = 0; i < n; i++) {
        ll a;
        int w;
        cin >> a >> w;
        klocki[a].insert(w);
    }

    ll m = 0;
    for (auto it = klocki.begin(); it != klocki.end(); it++) {
        ll a = it->first;
        ll k = m;
        for (set<int>::iterator w = (it->second).begin(); w != (it->second).end(); w++) {
            dp[*w] = max(dp[*w], max(dp[*w] + a, m + a - c));
            k = max(k, dp[*w]);
        }
        m = k;
    }

    cout << m << "\n";
}