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
#include <bits/stdc++.h>
#define fi first
#define se second 

typedef long long ll;

using namespace std;

int main()
{
	cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false);

	vector<ll> colory(5e5 + 1);
	int n, c, a, w;
	cin >> n >> c;

	vector<pair<int, int>> l;

	for (int i = 0; i < n; ++i)
	{
		cin >> a >> w;
		l.push_back({ a, w });
	}

	reverse(l.begin(), l.end());
	vector<ll> dp(n);
	ll ansMniejsz = 0, ans = 0, wielkosc = l[0].fi;
	ll pocColory = 0;

	for (int i = 0; i < n; ++i)
	{
		if (wielkosc > l[i].fi)
		{
			wielkosc = l[i].fi;
			ansMniejsz = ans;
		}

		if (l[pocColory].fi > l[i].fi)
		{
			for (int j = pocColory; j < i; ++j)
				colory[l[j].se] = max(colory[l[j].se], dp[j]);
			pocColory = i;
		}

		dp[i] = l[i].fi + max(ansMniejsz - c, colory[l[i].se]);
		//colory[l[i].se] = max(colory[l[i].se], dp[i]);
		ans = max(ans, dp[i]);
	}

	cout << ans << '\n';

	return 0;
}