import java.math.BigInteger;
import java.util.*;

class Main{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int k = scan.nextInt();
        ArrayList<Long> enemy = new ArrayList<Long>(n);
        long count = 0;

        if(n <= k) {System.out.println(count); scan.close();}
        else{
            for(int i = 0;i < n;i++){
                enemy.add(scan.nextLong());
            }
            scan.close();
            Collections.sort(enemy);

            for(int j = 0; j < n-k;j++) count += enemy.get(j);
            System.out.println(count);
        }
    }
}
/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