subroutine heapsort(n,array)
  implicit none
  integer,intent(in) :: n
  integer(8),intent(inout) :: array(1:n)
 
  integer ::i,k,j,l
  double precision :: t
 
  if(n.le.0)then
     write(6,*)"Error, at heapsort"; stop
  endif
  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


program BegC
  implicit none
  integer :: N, K, j!, sumh!, hmax(1)
  integer(8) ::sumh
  integer(8),allocatable,dimension(:) :: H

  read(*,*) N, K
  allocate(H(N))
  read(*,*) (H(j) ,j=1,N)
  

  
  
  if(K.ge.N) then
     print*, 0
     stop
  end if
  
  ! do j=1,K
  !    H(maxloc(H))=0
  ! enddo
  ! print *, sum(H)

  call  heapsort(N,H)
!  print *, H
  sumh=0
  do j=1,N-K
     sumh=sumh+H(j)
!     print *, sumh
  enddo
  
  print *,  sumh
  

end program BegC


