Järjestys

#include <iostream>
#include <algorithm>
using namespace std;
int as[1024];
const int Z = 1e9+7;
int main() {
	int t;cin>>t;
	while(t--){
		int n,x;cin>>n>>x;
		for(int i=0; i<n; ++i) cin>>as[i];
		sort(as,as+n);
		long long res=1;
		for(int i=1,j=0; i<n; ++i) {
			while(j<i && as[i]-as[j]>x) ++j;
			res = res*(i-j+1) % Z;
		}
		cout<<res<<'\n';
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED