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

__file__ = __file__.startswith('/home/a_farazei')


def input_():
    global __file__

    if not __file__:
        return input()

    if not hasattr(__file__, 'readline'):
        __file__ = open('input.txt', 'r')

    return __file__.readline()


class Node:
    def __init__(self, val):
        self.val = val
        self.next = None
        self.prev = None


n, k = map(int, input_().split())
arr = sorted(map(int, input_().split()))
res = 0

nodes = [Node(x) for x in arr]

for i in range(n - 1):
    nodes[i].next = nodes[i + 1]

for i in range(1, n):
    nodes[i].prev = nodes[i - 1]

t = nodes[0]
q = t.next

while q and t:
    if t.val < q.val <= t.val + k:
        if t.prev:
            t = t.prev
            t.next = q
            q.prev = t
        else:
            t = q
            t.prev = None
            q = q.next
    else:
        t = q
        q = q.next

while t:
    res += 1
    t = t.prev


print(res)
