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.Scanner;

public class MicroWorld {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        int max = 0;
        int[] arr = new int[1000000];
        for (int i = 0; i < n; i++) {
            int num = in.nextInt();
            if (num > max) {
                max = num;
            }
            arr[num]++;
        }
        int index = 0, count = 0;
        for (int i = 1; i <= max; i++) {
            if (arr[i] != 0 && arr[index] + k >= arr[i]) {
                count += arr[index];
                index = i;
            }
        }
        System.out.println(n - count);
        in.close();
    }
}
