0pts求条

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 510, M = 10010;
const int INF = 1e18;
int f[N][M];
int n, m;
int t[N];
int maxt;
signed main() {
	ios::sync_with_stdio(0);cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> t[i];
	sort(t + 1, t + n + 1);
	maxt = t[n];
	for (int i = 0; i < N; i++) {
		fill(f[i], f[i] + M, INF);
	}
	for (int i = t[1]; i <= maxt + m; i++) {
		f[1][i] = i - t[1];
	}
	for (int i = 2; i <= n; i++) {
		deque<int> dq;
		for (int j = t[i]; j <= maxt + m; j++) {
			int left = max(t[i - 1], j - m);
			while (!dq.empty() && dq.front() < left) {
				dq.pop_front();
			}
			if (j - 1 >= t[i - 1]) {
				while (!dq.empty() && f[i - 1][dq.back()] >= f[i - 1][j - 1]) {
					dq.pop_back();
				}
				dq.push_back(j - 1);
			}
			if (!dq.empty()) {
				f[i][j] = min(f[i][j], f[i - 1][dq.front()] + j - t[i]);
			}
			f[i][j] = min(f[i][j], f[i - 1][j] + j - t[i]);
		}
	}
	int ans = INF;
	for (int j = n; j <= maxt + m; j++) {
		ans = min(ans, f[n][j]);
	}
	cout << ans << "\n";
	return 0;
}