import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		int K = scan.nextInt();

		Long[] lifes = new Long[N];
		for (int i=0; i < N; i++) {
			lifes[i] = scan.nextLong();
		}
		Arrays.sort(lifes, Collections.reverseOrder());

		for (int i=0; i < K; i++) {
			if (i >= N) break;
			lifes[i] = Long.valueOf(0);
		}
		long ans = 0;
		for (long i : lifes) {
			ans += i;
		}
		System.out.println(ans);
	}
}
/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