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

import bisect

def solve(n, k, A):
    A.sort()

    pos = n - 1
    ret = 0

    while pos >= 0:
        while pos > 0 and A[pos] == A[pos - 1]:
            pos -= 1
        idx = bisect.bisect_left(A, A[pos] - k)
        ret += pos - idx
        if A[idx] == A[pos]:
            pos -= 1
        else:
            pos = idx
    return n - ret

def driver():
    inp = [*map(lambda x : int(x), input().split())]
    n, k = inp[0], inp[1]
    A = [*map(lambda x: int(x), input().split())]
    print(solve(n, k, A))

driver()