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.*;
public class B990 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt(), k = sc.nextInt();
        int ans = 0;
        List<Integer> list = new ArrayList<>();
        for (int i=0; i<n; i++) {
            list.add(sc.nextInt());
        }
        Collections.sort(list, Collections.reverseOrder());
        //for (int i : list) System.out.print(i + " ");
        //System.out.println();
        int i=0, j=1;
        while (i<n && j<n) {
        	while (i<n && j<n && list.get(i) == list.get(j)) {
        		i++; j++;
        	}
        	int temp = i;
	while (i<n && j< n && (list.get(i)-list.get(j)<=k || list.get(i)-list.get(j) == 0)) {
	    i++;
                j++;
                //System.out.println("yolo, i="+i+"  j="+j);
                //System.out.println("YOLO");
                if (j == n || i==n) {
                    break;
                }
            }
           // System.out.println(temp + " " + j);
            if (list.get(temp) != list.get(j-1)) {
            	while (temp < n-1 && list.get(temp) == list.get(temp+1)) temp++;
            	ans += (j-temp-1);
            }
            	
            i = j;
            j = i+1;
            //System.out.println("i="+i+" j="+j);
        }
        System.out.println(n-ans);
    }
}