2 1
1 1
 4 1
2 2 1 1
 10 1
2 6 3 4 2 4 4 3 2 1
 2 1
999152 999153
 8 1000000
1 1 5 1000000 1000000 2 2 2
 9 2
1 6 1 5 5 8 6 8 7
 15 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 1 4
8
 10 1
6 3 1 3 6 4 1 3 6 4
 10 1
1 2 3 5 6 8 10 11 9 4
 7 2
1 5 5 8 9 8 8
 2 1000000
1 1000000
 8 2
3 13 9 8 3 13 9 14
 1 1
1
 2 1
1 2

2
 2
 4
 1
 2
 4
 15
 1
 7
 2
 4
 1
 5
 1
 1

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

ls.sort()

d = {ls[0]: 1}
i = 1
l1 = [ls[0]]

while i < n:
    if ls[i] > ls[i - 1]:
        l1.append(ls[i])
        d[ls[i]] = 1
    else:
        d[ls[i]] += 1
    i += 1

l2 = [i - k for i in l1]

#print(l1, l2)
#print(d)

i = 0
j = 1
dec = 0
while i < len(l1) and j < len(l2):
    if i == j:
        j += 1
    elif l1[i] >= l2[j]:# and ls[i] < ls[j]:
        dec += 1 * d[l1[i]]
        i += 1
    else:
        i += 1

print(n - dec)
