import java.util.*;
import static java.lang.Math.ceil;
class Main{
	public static void main(String[] args){
		Scanner input = new Scanner(System.in);
		long n = input.nextLong();
		long k = input.nextInt();
		Vector h = new Vector();
		for(int i = 0;i < n; ++i){
			long x  = input.nextInt();
			h.add(x);
		}
		long ans = 0;
		Collections.sort(h);
		Collections.reverse(h);
		for(int i = 0;i < n; ++i){
			if(k > 0){
				k--;
			}else{
				ans += (long)h.elementAt(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