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.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.TreeMap;

/**
 *
 * @author Слава
 *
 */
public class Codeforces {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        TreeMap<Integer, Integer> ints = new TreeMap<Integer, Integer>();
        for (int i = 0; i < n; i++) {
            int tmp = sc.nextInt();
            ints.putIfAbsent(tmp, 0);
            ints.put(tmp, ints.get(tmp) + 1);
        }
        ArrayList<Integer> arr = new ArrayList<Integer>();
        for (Integer i : ints.keySet()) {
            arr.add(i);
        }
        int ans = 0;
        for (int i = 1; i < arr.size(); i++) {
            if (arr.get(i) > arr.get(i - 1) && arr.get(i) <= arr.get(i - 1) + k) {
                ans += ints.get(arr.get(i - 1));
            }
        }
        System.out.println(n - ans);
    }
}
