integer N,K
integer,allocatable,dimension(:)::A
integer B(200000),sizeB
integer tmp,tmpcnt,ans
read*,N,K
allocate(A(N))
read*,A
call heapsort(N,A)
tmp=A(1);tmpcnt=0;sizeB=0
do i=1,N
  if(A(i)==tmp)then
    tmpcnt=tmpcnt+1
  else
    sizeB=sizeB+1
    B(sizeB)=tmpcnt
    tmp=A(i)
    tmpcnt=1
  endif
end do
sizeB=sizeB+1
B(sizeB)=tmpcnt
call heapsort(sizeB,B(1:sizeB))
if(sizeB>K)then
  ans=sum(B(1:sizeB-K))
else
  ans=0
endif
print"(I0)",ans
contains
subroutine heapsort(n,array)
  implicit none
!ここの入力は状況に応じて変更すること
  integer,intent(in) :: n
  integer,intent(inout) :: array(1:n)
  integer::i,k,j,l
  integer:: t

  l=n/2+1
  k=n
  do while(k /= 1)
     if(l > 1)then
        l=l-1
        t=array(L)
     else
        t=array(k)
        array(k)=array(1)
        k=k-1
        if(k == 1) then
           array(1)=t
           exit
        endif
     endif
     i=l
     j=l+l
     do while(j<=k)
        if(j < k)then
           if(array(j) < array(j+1))j=j+1
        endif
        if (t < array(j))then
           array(i)=array(j)
           i=j
           j=j+j
        else
           j=k+1
        endif
     enddo
     array(i)=t
  enddo
  return
end subroutine heapsort
end