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

#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k;
  cin >> n >> k;
  int l = 1e6 + 1;
  int a[l];
  int i;
  int x;
  for (i = 0; i < l; i++) a[i] = 0;
  for (i = 1; i <= n; i++) {
    cin >> x;
    a[x]++;
  }
  int max = 0;
  for (i = 0; i < l; i++) {
    if (a[i] == 0)
      a[i] = max;
    else {
      a[i] += max;
      max = a[i];
    }
  }
  max = 0;
  for (i = 0; i < l; i++) {
    if (a[i] > max) {
      if (i + k < l && a[i + k] > a[i])
        n = n - a[i] + max;
      else if (i + k >= l && a[l - 1] > a[i])
        n = n - a[i] + max;
      max = a[i];
    }
  }
  cout << n << endl;
}
