30pts玄关

123456789101112131415161718192021222324252627282930#include<bits/stdc++.h>
using namespace std;
#define int long long
int n, k, a[55555];
signed main(){
    cin >> n >> k;
    for (int i = 1; i <= n; i ++){
        cin >> a[i];
    }
    sort(a+1, a+n+1);
    int l = 1, r = 1;
    vector<int> v;
    bool flag = false;
    while (l <= n and r <= n){
        if (a[r] - a[l] > k){
            if (flag){
                v.push_back(r - l);
                flag = false;
            }
            l ++;
        }
        else{
            r ++; flag = true;
        }
    }
    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    cout << v[0] + v[1];
    return 0;
}