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.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
public class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		Scanner sc=new  Scanner(System.in);
	    int n=sc.nextInt();
	    int k=sc.nextInt();
	    TreeMap<Integer,Integer> tree=new TreeMap<>();
	    for(int i=0;i<n;i++){
	        int p=sc.nextInt();
	        if(!tree.containsKey(p)){
	            	        tree.put(p,1);
	        }
	        else{
	            tree.put(p,tree.get(p)+1);
	        }
	    }
        int count=0;int ele=0;int c=0;
        for(int x:tree.keySet()){
            if(count==0){
                ele=x;
            }
            
            if(x>ele && (x<=(ele+k))){
                c=c+tree.get(ele);
            }
            ele=x;
            count=count+1;
            
        }
        System.out.println(n-c);
	}
}
