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

s = map(int, raw_input().split())
n = s[0]
K = s[1]

check = [True] * 200100
arr = map(int, raw_input().split())
arr.sort(reverse=True)
novo = []
freq = {}

for i in arr:
	if i not in freq:
		freq[i] = 0
		novo.append(i)
	freq[i] += 1
ans = n

#print novo
#print freq
for i in xrange(len(novo) - 1):
	if novo[i] <= novo[i + 1] + K:
		#print novo[i], novo[i + 1]
		#print freq[novo[i]]
		ans -= freq[novo[i + 1]]
		freq[novo[i]] = 0

print ans