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;
map<int, int> Map;
set<int> Set, Sec;
int ans;
int main() {
  int N, K;
  int num;
  cin >> N >> K;
  for (int i = 0; i < N; i++) {
    scanf("%d", &num);
    Set.insert(num);
    if (Map.find(num) == Map.end()) {
      Map.insert(make_pair(num, 1));
    } else {
      Map[num] = Map[num] + 1;
    }
  }
  set<int>::iterator iter = Set.begin();
  set<int>::iterator lst = iter;
  iter++;
  for (; iter != Set.end(); iter++) {
    if (*lst + K >= *iter) {
      Sec.insert(*lst);
    }
    lst++;
  }
  for (iter = Sec.begin(); iter != Sec.end(); iter++) {
    ans += Map[*iter];
  }
  cout << N - ans << endl;
  return 0;
}
