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

import java.util.*;
public class Hello {
	public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int k = in.nextInt();
        long [] hash = new long[2000007];
        int [] arr = new int[n];
        for(int i=0; i<n; i++){
        	arr[i]=in.nextInt();
        	hash[arr[i]]=1;
        }
        for(int i=2; i<=2000000; i++){
        	hash[i]+=hash[i-1];
        }
        long c=0;
        for(int i=0; i<n; i++){
        	if(hash[arr[i]+k]-hash[arr[i]]>0){
        		c++;
        	}
        }
        System.out.println(n-c);
    }
}