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


from bisect import *

from collections import defaultdict

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

l = list(map(int,input().split()))

l.sort()

hash = defaultdict(int)

for i in l:
    hash[i]+=1

la = list(set(l))
la.sort()
count = 0
# print(la)
yo = set()
for j,i in enumerate(la):

    z1 = len(la)-j-1
    if z1>0:
        if i+k in hash:
            yo.add(j)

            count+=1
            continue
        else:
            z2 = bisect_right(la,i+k)

            if z2>j+1 :

                yo.add(j)
                count+=1

ans = 0

for i in range(len(la)):
  if i not in yo:
    ans+=hash[la[i]]

print(ans)





