Driving

#include <iostream>
#include <algorithm>
using namespace std;


int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int n, p;
	cin >> n >> p;
	int t[n];
	for (int i = 0; i < n; ++i) cin >> t[i];
	sort(t, t+n);
	int result = 0;
	for (int i = 0; i < n; ++i) {
		result = max(result, t[0] - (t[i] - (i+1)*p));
	}
	cout << result;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED