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
#include <bits/stdc++.h>
using namespace std;
void maxi(long long& a, long long b) {
	a = max(a, b);
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n, c;
	cin >> n >> c;
	vector<int> sz(n), color(n);
	int M = 0;
	for (int i = 0; i < n; i++) {
		cin >> sz[i] >> color[i];
		M = max(M, color[i]);
	}
	vector<long long> dp(M + 1);
	long long DP = 0;
	vector<pair<int, long long>> v;
	for (int i = 0; i <= n; i++) {
		if (i == n || (i != 0 && sz[i] != sz[i-1])) {
			for (auto p : v) {
				maxi(dp[p.first], p.second);
				maxi(DP, p.second);
			}
			v.clear();
		}
		if (i == n) {
			break;
		}
		long long me = max(DP - c, dp[color[i]]) + sz[i];
		v.emplace_back(color[i], me);
	}
	cout << DP << "\n";
}