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 whatever //do not write package name here */

import java.util.*;

public class GFG {
	public static void main (String[] args) {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int k=sc.nextInt();
		HashMap<Integer,Integer> hmap=new HashMap<Integer,Integer> ();
		int i=0,sum=0;
		for(i=0;i<n;i++)
		{
		    int ele=sc.nextInt();
		    if(hmap.containsKey(ele))
		        hmap.put(ele,((hmap.get(ele))+1));
		  else
		    hmap.put(ele,1);
		    sum+=1;
		}
		ArrayList<Integer> a=new ArrayList<>(hmap.keySet());
		Collections.sort(a);
		//System.out.println(sum+" "+hmap+" "+a);
		for(i=a.size()-1;i>=1;i--)
		{
		        if(a.get(i)>a.get(i-1)&&a.get(i)<=(a.get(i-1)+k))
		        sum-=hmap.get(a.get(i-1));
		}
		    System.out.println(sum);
		
	}
}