import java.util.Arrays;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		long N = sc.nextLong(), K = sc.nextLong();
		long[] mon = new long[(int)N];
		for(int i = 0; i < N; i++) {
			mon[i] = sc.nextLong();
		}
		Arrays.sort(mon);
		if(N<=K) {
			System.out.println(0);
		}else {
			for(int j = (int)N-1; j >= N-K; j--) {
				mon[j] = 0;
			}
			long sum = Arrays.stream(mon).sum();
			System.out.println(sum);
		}
	}
}
/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