# Arup Guha
# 2/24/2024
# Solution to SER D2 Problem C: A Cappella Recording

# Get list size # max difference.
toks = input().split()
n = int(toks[0])
diff = int(toks[1])

# Get items.
items = []
for i in range(n):
    x = int(input())
    items.append(x)

# Sort.
items.sort()

i = 0
res = 0

# Do greedy sweep.
while i<len(items):

    # Get as many notes as we can.
    j = i
    while j<len(items) and items[j] - items[i] <= diff:
        j+=1

    # Update answer and next starting point.
    res += 1
    i = j

# Ta da!
print(res)