9分求调

#include <bits/stdc++.h>
using namespace std;
int n,d,p[1000005],ans;
int main(){
    cin >> n >> d;
    for (int i=1;i<=n;i++)
        cin >> p[i];
    sort (p+1,p+n+1);
    for (int i=1;i<=n;i++){
        int l=i,r=n;
        while (l<r){
            if (p[r]-p[l]>d)
                r--;
            else{
                ans++;
                break;
            }
        }
    }
    cout << ans;
}