谢各路神仙

#include <bits/stdc++.h>
using namespace std;
int a[1001]; 
int main()
{
	int n,k,p,q,sum=0;
	cin>>n>>k;
	for (int i=1;i<=n;i++) cin>>a[i];
	sort (a+1,a+n+1);
	q=n;
	while (q!=1)
	{	
		for (p=1;p<q;p++)
			if (a[q]-a[p]<=k) break; //双指针
		if (a[q]-a[p]<=k) break;
	}
	for (int i=p;i<=q;i++)	sum+=a[i];
	cout<<sum;
	return 0;
}