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

//package bag;


import java.io.*;
import java.lang.reflect.Array;
import java.text.MessageFormat;
import java.util.*;

/**
 * Created by Enzo Cotter on 2019/4/30.
 */
public class Main {
    static final int N =200005;
    public static void main(String[] args) {
        int n, k;
        Scanner in =new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        n = in.nextInt();
        k = in.nextInt();
        int []a = new int[N];
        for (int i = 1; i <= n; i++)
            a[i] = in.nextInt();
        Arrays.sort(a,1,1 + n);
        int res = n;
        for (int i = 1; i <= n; i++) {
            if (i > 1 && a[i - 1] + k >= a[i])
                res--;
        }
        System.out.print(res);
    }
}
