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.*;
import java.util.*;

public class MicroWorld {

	public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
		int n = in.nextInt();
		int k = in.nextInt();
		Integer a[] = new Integer[n];
		for(int i=0;i<n;i++) a[i] = in.nextInt();
		Arrays.parallelSort(a);
		int cnt = 1;
		for(int i=n-1;i>0;i--) {
			if(a[i]>a[i-1]&&a[i]-a[i-1]<=k) {
				int j=i-1;
				while(j>=0&&a[i]-a[j]<=k) {
					j--;
				}
				i = j+2;
			}
			else cnt++;
		}
		out.println(cnt);
		out.close();in.close();
	}
}







