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

public class codechef
{
	static long mod=1000000007;
	public static void main(String[] args) throws IOException
	{
		FastReader in=new FastReader();
		int n=in.nextInt();
		int k=in.nextInt();
		Integer[] arr=new Integer[n];
		for(int i=0;i<n;i++)
		{
			arr[i]=in.nextInt();
		}
		Arrays.sort(arr);
		int ans=n,c=1;
		for(int i=1;i<n;i++)
		{
			if(arr[i-1]==arr[i])
			{
				c++;
			}
			else
			{
			    if(arr[i-1]+k>=arr[i])
			    {
				    ans=ans-c;
			    }
				c=1;
			}
		}
		System.out.println(ans);
	}
}

class FastReader
{
	BufferedReader br;
	StringTokenizer st;

	public FastReader()
	{
		br=new BufferedReader(new InputStreamReader(System.in));
	}

	public String next()
	{
		try
		{
			if(st==null || !st.hasMoreElements())
			{
				st=new StringTokenizer(br.readLine());
			}
			return st.nextToken();
		}
		catch(Exception e)
		{
			return "-";
		}
	}

	public int nextInt() throws IOException
	{
		return Integer.parseInt(next());
	}

	public long nextLong() throws IOException
	{
		return Long.parseLong(next());
	}
}