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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n, c;
    cin >> n >> c;
    vector<pair<int, int>> klocki(n);

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

    vector<int> dp(n, 0);
    vector<int> ostatni_wzorek(n, 0);
    int maks_ocena = 0;

    for (int i = 0; i < n; ++i) {
        dp[i] = klocki[i].first;
        ostatni_wzorek[i] = klocki[i].second;
        for (int j = 0; j < i; ++j) {
            if (klocki[j].first < klocki[i].first) {
                int ocena = dp[j] + klocki[i].first;
                if (klocki[j].second != klocki[i].second) {
                    ocena -= c;
                }
                if (ocena > dp[i]) {
                    dp[i] = ocena;
                    ostatni_wzorek[i] = klocki[i].second;
                }
            }
        }
        if (dp[i] > maks_ocena) {
            maks_ocena = dp[i];
        }
    }

    cout << maks_ocena << endl;

    return 0;
}