求助各位大佬，谢谢！

20分，只AC#1，#8

#include <bits/stdc++.h>
using namespace std;
int n,maxn,secmaxn,k,a[50005],f[50005];
int main(){
	scanf("%d%d",&n,&k);
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    int r=0;
    for(int i=1;i<=n;i++){
        while(r<=n-1&&a[i]+k>=a[r+1])r++;
        if(r-i+1>=maxn){
            secmaxn=maxn;
            maxn=r-i+1;
        }
        //cout<<i<<' '<<r<<endl; 
    }
    printf("%d",secmaxn+maxn);
	return 0;
}