program ABC081C
    implicit none
    integer(8)::N,K,val_count=0,i,ans=0
    integer(8),allocatable::A(:),C(:)
    read*,N,K
    allocate(A(N))
    allocate(C(N))
    read*,A
    C=0
    do i=1,N
        if(C(A(i))==0)val_count=val_count+1
        C(A(i))=C(A(i))+1
    end do

    if(val_count<=K)then
        print'(i0)',0
    else
        val_count=val_count-K
        call heapsort(N,C)
        do i=1,N
            if(val_count==0)exit
            if(C(i)>0)then
                ans=ans+C(i)
                val_count=val_count-1
            end if
        end do
        print'(i0)',ans
    end if
end program ABC081C

subroutine heapsort(n,array)
    implicit none
    integer(8),intent(in) :: n
    integer(8),intent(inout) :: array(1:n)
   
    integer(8) ::i,k,j,l
    integer(8) :: t
   
    if(n.eq.1)return
  
    l=n/2+1
    k=n
    do while(k.ne.1)
       if(l.gt.1)then
          l=l-1
          t=array(L)
       else
          t=array(k)
          array(k)=array(1)
          k=k-1
          if(k.eq.1) then
             array(1)=t
             exit
          endif
       endif
       i=l
       j=l+l
       do while(j.le.k)
          if(j.lt.k)then
             if(array(j).lt.array(j+1))j=j+1
          endif
          if (t.lt.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