Järjestys

#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
#define F first
#define S second
#define X first
#define Y second
 
const int N = 1e5 + 5;
const ll INF = 1e18;
 
const ll M = 1e9 + 7;
 
int main() {
	int t;
	cin >> t;
	while(t > 0) {
		--t;
 
		int n;
		cin >> n;
		int x;
		cin >> x;
 
		vector<int> a;
		for(int i = 1; i <= n; ++i) {
			int A; cin >> A;
			a.push_back(A);
		}
		sort(a.begin(), a.end());
 
 
		ll ans = 1;
 
		for(int i = 2; i <= n; ++i) {
			//Add a[i]
 
			ll cur = 1;
			for(int j = 0; j < i-1; ++j) {
				if(a[j] >= a[i-1] - x) {
					++cur;
				}
			}
			ans *= cur;
			ans %= M;
 
		}
		cout << ans << "\n";
 
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED