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

class Main {
  public static void main(String[] args){
      Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        int[] H = new int[N];
        for(int i = 0; i < N; i++) {
          H[i] = sc.nextInt();
          //System.out.println(H[i]);
        }
        Arrays.sort(H);
      	
        for(int i = 1; i <= K; i++) {
          if(N <= K) {
          	for(int j = 0; j < N; j++) {
          		H[j] = 0;  
        	}
            break;
          }
          H[N-i] = 0;
        }
    	
        long count = 0;
        for(int j = 0; j < N; j++) {
          count += H[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