Järjestys

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = (int)1e9 + 7;

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

	int t;
	cin >> t;
	for (int ti = 0; ti < t; ++ti) {
		int n, x;
		cin >> n >> x;

		vector<int> vals(n);
		for (int& v : vals) cin >> v;
		sort(vals.begin(), vals.end());
		
		int j = 0;
		ll res = 1;
		for (int i = 0; i < n; ++i) {
			while(j < n && vals[i] >= vals[j] - x) ++j;
			res = (res * (j-i)) % MOD;
		}
		cout << res << '\n';
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED