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.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Scanner;

public class micro{


    static int n, k;
    static Scanner scanner = new Scanner(System.in);
    static List<Integer> list = new ArrayList<Integer>(200000);
    static HashMap<Integer, Integer> map = new HashMap<>(200000);
    

    
    public static void main(String[] args) {

        n = scanner.nextInt();
        k = scanner.nextInt();

        int current;
        for(int i = 0; i < n; ++i){

            current = scanner.nextInt();

            if(map.containsKey(current)){
                map.put(current, map.get(current) + 1);
                continue;
            }

            list.add(current);
            map.put(current, 1);
        }


        Collections.sort(list);

        int n_copy = n, a, b;
        for(int i = 0; i < list.size() - 1; ++i){

            a = list.get(i);
            b = list.get(i + 1);

            n_copy = b > a && b <= a + k ? n_copy - map.get(a) : n_copy;


        }

        System.out.println(n_copy);
        
    }




}