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 b[1200050];
int main() {
  int a[200050];
  int n, k;
  int i, j;
  scanf("%d%d", &n, &k);
  int ans = 0, lin = 0;
  for (i = 0; i < n; i++) {
    scanf("%d", &j);
    if (b[j] == 0) {
      a[lin++] = j;
    }
    b[j]++;
  }
  sort(a, a + lin);
  for (i = 0; i < lin; i++) {
    int ji = 0;
    for (j = i + 1; j < lin; j++) {
      if (a[j] <= a[i] + k) {
        ans += b[a[i]];
        b[a[i]] = 0;
        ji = j;
      } else
        break;
    }
    if (ji) i = ji - 1;
  }
  cout << n - ans;
  return 0;
}
