题解 | #相差不超过k的最多数#

import sys

 
s = input().split()
n = int(s[0])
k = int(s[1])
numbers = list(map(int,input().split()))
 
numbers.sort()
 
 
def findmax(numbers):
    ans=0
    left=0
    right=0
    while right < n:
        if numbers[right]-numbers[left]<=k:
            ans=max(ans,right-left+1)
            right+=1

        else:
            left+=1

                 
    return ans
 
 
ans =findmax(numbers)
print(ans)