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;

vector<int> nums;


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

    int maks=0;
    int n,m;
    cin>>n>>m;

    nums.assign(n,0);
    vector<int> indices(n);
    for (int i=0;i<n;i++) indices[i] = i;

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

    sort(indices.begin(),indices.end(),[](int a,int b) {
        return nums[a]>nums[b];
    });
    int wynik = 0;
    for (int i=1;i<n;i++) {

        for (int j=0;j<n;j++) {
            int val = nums[indices[i]];

            if (nums[j]<=val or j == indices[i]) continue;
            if (abs(indices[i]-j)*m < nums[j]-val) {
                nums[indices[i]] += (nums[j]-val-abs(indices[i]-j)*m);
                wynik+=(nums[j]-val-abs(indices[i]-j)*m);
            }
        }
    }

    cout<<wynik;
    return 0;
}