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

'''input
6 5
20 15 10 15 20 25

'''
from collections import defaultdict as df
from bisect import bisect_left as bl 
from itertools import combinations as c
import sys
from math import factorial as F
from random import randint as R
import heapq

n,k=[int(x) for x in raw_input().split()]
A=[int(x) for x in raw_input().split()]
C=df(int)
for i in A:
	C[i]+=1
B=sorted(list(set(A)))
count=0
for i in range(len(B)-1):
	if B[i+1]-B[i]<=k:
		count+=C[B[i]]
print len(A)-count