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

n, k = map(int, input().split())
arr = list(map(int, input().split()))

# Algo
arr.sort()
maxLen = 0
arr.append(1e10)  # Sentinel
n += 1
i = 0
for j in range(n):
    if arr[j] - arr[i] > k:
        maxLen = max(maxLen, j-i)
        while arr[j] - arr[i] > k:
            i += 1

# Output
print(maxLen)