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

def func(list, first_index, search_index, k):
    if first_index == search_index:
        return -1
    if list[first_index] - list[search_index] <= k :
        return search_index
    else:
        return func(list, first_index, int((search_index + first_index) / 2), k)


n, k = map(int, input().split())
list = list(map(int, input().split()))
list.sort()
list.reverse()
print(list)
i = 0
while i < len(list):
    mid = int((len(list)+i) / 2)
    a = func(list, i, mid, k)
    if a != -1:
        del list[a]
        i-=1
    i+=1

print(len(list))
