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 = 10**6
n, K = map(int, raw_input().split())
ai = map(int, raw_input().split())

if n == 1:
    print(1)
    exit()

def eaten(j, i):
    return ai[j] < ai[i] <= ai[j] + K

nbrOfEaten = 0
ai.sort()
biggest = len(ai) - 1
tryEat = biggest - 1
while tryEat > -1:
    if eaten(tryEat,biggest):
        tryEat -= 1
        nbrOfEaten += 1
    #    print('{} ate {}'.format(ai[biggest], ai[tryEat]))
    else:
        if eaten(tryEat,tryEat + 1):
            nbrOfEaten += 1
            biggest = tryEat + 1
            tryEat -= 1
        else:
            biggest = tryEat
            tryEat = biggest - 1
    #    print('Could not eat {} '.format(ai[biggest]))



left = n - nbrOfEaten
print(left)
