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 sys import stdin, stdout 
from bisect import bisect_left, bisect_right
import math
cin = stdin.readline
def cout(x):
	stdout.write(str(x)+'\n')

def nexint():
    return int(stdin.readline())
def readline():
    return map(int,stdin.readline().split())
def readlist():
    return list(map(int,stdin.readline().split()))

def find_lt(a, x):#'Find rightmost value less than x'
    i = bisect_left(a, x)
    if i:
        return a[i-1]
    raise ValueError

def find_gt(a, x):#'Find leftmost value greater than x'
    i = bisect_right(a, x)
    if i != len(a):
        return a[i]
    raise ValueError

# ---------------------Template ends-------------------------------------

n,k = readline()
arr = readlist()

arr.sort()

count = 0
for x in arr:
	ix = bisect_right(arr,x)
	if ix != len(arr) and  x < arr[ix] <= x+k :
		count+=1
	
cout(n-count)
		





	
