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 Solution {
	public static void main(String args[]){

		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		long K = in.nextLong();

		int i, counter = 0, j;
		//Long[] A = new Long[n];

		in.nextLine();
		List<Integer> numbers = new ArrayList<Integer>();
		int max = n;
	    while(max > 0) {
	    	 int num = in.nextInt();
	  //  	 System.out.println(num);
	      numbers.add(num);
	      max--;
	    }
 

	    Collections.sort(numbers);
	    
	  //  System.out.println(numbers);
	/*
	    for(i = 0; i < n; i++){
	        A[i] = in.nextLong();
	    }
	    */


	  //  Arrays.sort(A);

	    i = 1;
	    j = 0;

	    while(i < n){

	    	if(numbers.get(i) != numbers.get(j) && (numbers.get(i) <= (numbers.get(j) + K))){
	    		counter++;
	    		j++;
	    	}else if(numbers.get(i) == numbers.get(j)){
	    		i++;
	    	}else{
	    		j++;
	    		if(i == j)
	    			i++;
	    	}
	    } 

	    System.out.println(n - counter);
	  }
}
