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

        public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
             int n = input.nextInt();
             int k = input.nextInt();
             int ans[] = new int[2000000];
//            Integer a[] = new Integer[n];
ArrayList<Integer> a = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                int value = input.nextInt();
                a.add(value);
                ans[value]++;
            }
            Collections.sort(a);
            int count=0;
            for (int i = 0; i < n-1; i++) {
                if(a.get(i)<a.get(i+1)&& a.get(i)+k>=a.get(i+1))
                {
                    count+=ans[a.get(i)];
                }
            }
            System.out.println(n-count);
           
              
        }

    }

