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 <bits/stdc++.h>

using namespace std;

constexpr int MAX_N = 1e3;

int n, k, a[MAX_N];
long long ans;

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

    cin >> n >> k;

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 1; j < n; ++j) {
            if (a[j - 1] < a[j]) {
                int diff = a[j] - a[j - 1];

                if (diff > k) {
                    ans += (diff - k);
                    a[j - 1] += (diff - k);
                }
            }
            else {
                int diff = a[j - 1] - a[j];

                if (diff > k) {
                    ans += (diff - k);
                    a[j] += (diff - k);
                }
            }
        }
    }

    cout << ans << '\n';
}