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 argc, const char* argv[]) {
  for (int i = 0; i < argc; i++) {
    if ((string)argv[i] == "viLap") {
      freopen("input.txt", "r", stdin);
      freopen("output.txt", "w", stdout);
    }
  }
  int n, K;
  cin >> n >> K;
  vector<int> mas(n);
  for (int i = 0; i < n; i++) {
    cin >> mas[i];
  }
  sort(mas.begin(), mas.end());
  int ans = 0;
  int eat = 0;
  int i = 1;
  int j = 0;
  while (i < n) {
    if (mas[j] < mas[i]) {
      if (mas[i] <= (mas[j] + K)) {
        if ((i - j) == 1) i++;
        j++;
        eat++;
      } else {
        ans++;
        i++;
        j = i - 1;
      }
    } else {
      i++;
    }
  }
  cout << n - eat;
  return 0;
}
