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

//package codeforces.Educational.Round45;

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Scanner;

public class MicroWorld {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int total = s.nextInt();
        int k = s.nextInt();

        ArrayList<Integer> a = new ArrayList<>(total);
        HashMap<Integer, Integer> count = new HashMap<>();
        for (int i = 0; i < total; i++) {
            int num  = s.nextInt();
            if (count.containsKey(num)) {
                count.put(num, count.get(num) + 1);
            } else {
                count.put(num, 1);
                a.add(num);
            }
        }
        Collections.sort(a);

        for (int i = 0; i < a.size() - 1; i++) {
            if (a.get(i) < a.get(i + 1) && a.get(i) + k >= a.get(i+1)) {
                total -= count.get(a.get(i));
            }
        }

        System.out.println(total);
    }
}
