O(N²)

6/20

#include <bits/stdc++.h>
using namespace std;

int main() {
	int N, K; cin >> N >> K;
	vector<int> h(N); for (int& i: h) cin >> i;
	for (int i = 1; i < N; ++i) {
		int j = i;
		while (j && abs(h[i]-h[j-1]) <= K) --j;
		while (j < i && h[j] <= h[i]) ++j;
		rotate(begin(h)+j, begin(h)+i, begin(h)+i+1);
	}
	for (int i: h) cout << i << "\n";
}