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
#include <iostream>
#include <algorithm>
using namespace std;

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

    pair<int, int> t[n];
    for(int i = 0; i < n; ++i){
        cin >> t[i].first >> t[i].second;
    }

    sort(t, t+n);
    int dp[n]={};
    int maxi=0, wyn=0, max_h=0;
    int spis[500000]={};
    for(int i = 0; i < n; ++i){
        dp[i] = max((maxi+t[i].first)-c, spis[t[i].second]+t[i].first);

        spis[t[i].second] = dp[i];

        max_h = max(max_h, dp[i]);

        if(i != n-1 && t[i].first != t[i+1].first){
            maxi = max(maxi, max_h);
        }

        wyn = max(wyn, dp[i]);
    }

    cout << wyn << '\n';
}