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.util.Arrays;
import java.util.Random;
import java.util.Scanner;

public class B {

	static int[] a;
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		int K = in.nextInt();
		
		a = new int[n];
		for(int i = 0; i < n; ++i)  {
			a[i] = in.nextInt();
		}
		shuffle(a);
		Arrays.sort(a);
		
		int i = 0; int j = 1;
		
		int num = 0;
		while(j < n && i < n) {
			if(a[j] - a[i] <= K && a[j] > a[i]) {
			//	System.out.println(i + " " + j );
			//	System.out.println(a[j] + " eats " + a[i]);
				num++;
				i++;
			}
			else if(a[j] == a[i]) j++;
			else i++;
			if(i == j) j++;
		}
		System.out.println(a.length - num);
	}
	
	static void shuffle(int[] a) {
		  Random r = new Random();
		  int j; 
		  for (int i = a.length - 1; i > 0; i--) {
		   j = r.nextInt(i + 1);
		   if(i == j) continue;
		   a[i] = a[i] ^ a[j];
		   a[j] = a[i] ^ a[j];
		   a[i] = a[i] ^ a[j];
		  }
		 }
	

}
