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

//package pack;

import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class first
{	
	public static Scanner sc = new Scanner(System.in);
	static int T;
	static int N, M, K;
	
	public static void main(String[] args) {
		N = sc.nextInt();
		K = sc.nextInt();
		List<Integer> lst = new ArrayList<>();
		int[] freq = new int[1000006];
		for (int i = 0; i < N; i++) {
			int v = sc.nextInt();
			if (freq[v] == 0) {
				lst.add(v);
			}
			freq[v]++;
		}
		
		Collections.sort(lst);
		
		int ans = N;
		for (int i = 1; i < lst.size(); i++) {
			if (lst.get(i) - lst.get(i-1) <= K) {
				ans -= freq[lst.get(i-1)];
			}
			}
		System.out.println(ans);
		System.exit(0);	
	}
}