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

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class microworld {

	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

		StringTokenizer st = new StringTokenizer(in.readLine());
		int n = Integer.parseInt(st.nextToken());
		int k = Integer.parseInt(st.nextToken());
		
		Integer[] nums = new Integer[n];
		TreeSet<Integer> set = new TreeSet<Integer>();
		
		StringTokenizer st1 = new StringTokenizer(in.readLine());
		for (int i = 0; i < n; i++) {
			int num = Integer.parseInt(st1.nextToken());
			nums[i] = num;
			set.add(num);
		}
		
		Arrays.parallelSort(nums);
		
		int count = 0;
		for (int i = 0; i < n; i++) {
			if(set.higher(nums[i]) == null)
				continue;
			int next = set.higher(nums[i]);
			if(nums[i] + k >= next)
				count++;
		}
		
		out.println(n - count);
		
		in.close();
		out.close();
	}
	
}
