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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int K = sc.nextInt();
		Long[] H = new Long[N];

		for (int i = 0; i < N; i++) {
			H[i] = sc.nextLong();
		}

		if (K >= N) {
			System.out.println(0); // 全て必殺技
		} else {
			Arrays.sort(H, Collections.reverseOrder());

			Long[] M = Arrays.copyOfRange(H, K, H.length);
			long sum = 0;

			for (int i = 0; i < M.length; i++) {
				sum += M[i];
			}

			System.out.println(sum);
		}

		sc.close();
	}

}

/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