import java.util.*;
public class Main { 
    public static void main(String[] args) {
       Scanner sc=new Scanner(System.in);
       long o=0;
       long n=sc.nextLong();
       long k=sc.nextLong();
       PriorityQueue<Long> pq = new PriorityQueue<>(Collections.reverseOrder());
       for(long i=0;i<n;i++){
           pq.offer(sc.nextLong());
       }
       if(n<=k){
           o=0;
       }else{
            for(long i=0;i<k;i++){
                pq.poll();
            }
            while(pq.size()>0){
                o+=pq.poll();
            }
       }
      System.out.println(o);
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz