#include <iostream> 
#include <algorithm>
using namespace std;
int n,distence,a[100005],l,r,ans;
int main(){
	cin>>n>>distence;
	for (int i=0;i<n;i++){
		cin>>a[i];
	}
	sort(a,a+n);
	for (int i=0;i<n;i++){
		if(i!=0){
			l=i-1,r=i;
			while(a[i]==0) l--;
			if(r-l<=distence && r!=n-1){
				a[r]=0;
				ans++;
			} 
				
			
		}
	}
	cout<<ans;
	return 0;
}