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 A_GENERAL {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int k = sc.nextInt();
		int count[] = new int[2000001];
		int a[] = new int[n];
		HashSet<Integer> hs = new HashSet<>();
		
		for(int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
			count[a[i]]++;
			hs.add(a[i]);
		}
//		Arrays.sort(a);
		ArrayList<Integer> al = new ArrayList<>(hs);
		Collections.sort(al);
		
		int tot = 0;
		for(int i = 0; i < al.size()-1; ) {
			if(al.get(i) == al.get(i+1)) {
				i += count[al.get(i)]-1;
			}
			else if(al.get(i)+k >= al.get(i+1)) {
//				System.out.println(a[i]+ ", "+ count[a[i]]);
				tot += count[al.get(i)];
				i++;
			}
			else {
				i++;
			}
		}
//		for(int i = 0; i < n-1; ) {
//			if(a[i] == a[i+1]) {
//				i += count[a[i]]-1;
//			}
//			else if(a[i]+k >= a[i+1]) {
////				System.out.println(a[i]+ ", "+ count[a[i]]);
//				tot += count[a[i]];
//				i++;
//			}
//			else {
//				i++;
//			}
//		}
		System.out.println(n-tot);
		
		sc.close();
		
	}
	
}