import java.util.Scanner;
import java.util.Arrays;
import java.util.Collections;
public class Main{
  public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    long sum  =0;
    Long[] HP = new Long[N];
    for(int i=0; i<N; i++)
      HP[i] = sc.nextLong();
    
    if(K >= N)
      sum = 0;
    else{
		Arrays.sort(HP, Collections.reverseOrder());
       for(int i = K; i<N; i++){
         sum += HP[i];
       }
    }
    System.out.println(sum);
    
    
  }
} import java.util.Scanner; Scanner java.util import java.util.Arrays; Arrays java.util import java.util.Collections; Collections java.util public class Main{
  public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    long sum  =0;
    Long[] HP = new Long[N];
    for(int i=0; i<N; i++)
      HP[i] = sc.nextLong();
    
    if(K >= N)
      sum = 0;
    else{
		Arrays.sort(HP, Collections.reverseOrder());
       for(int i = K; i<N; i++){
         sum += HP[i];
       }
    }
    System.out.println(sum);
    
    
  }
} Main public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    long sum  =0;
    Long[] HP = new Long[N];
    for(int i=0; i<N; i++)
      HP[i] = sc.nextLong();
    
    if(K >= N)
      sum = 0;
    else{
		Arrays.sort(HP, Collections.reverseOrder());
       for(int i = K; i<N; i++){
         sum += HP[i];
       }
    }
    System.out.println(sum);
    
    
  } main {
	Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    long sum  =0;
    Long[] HP = new Long[N];
    for(int i=0; i<N; i++)
      HP[i] = sc.nextLong();
    
    if(K >= N)
      sum = 0;
    else{
		Arrays.sort(HP, Collections.reverseOrder());
       for(int i = K; i<N; i++){
         sum += HP[i];
       }
    }
    System.out.println(sum);
    
    
  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int K = sc.nextInt(); K sc.nextInt() sc.nextInt sc long sum  =0; sum 0 Long[] HP = new Long[N]; HP new Long[N] N for(int i=0; i<N; i++)
      HP[i] = sc.nextLong(); int i=0; int i=0; i 0 i<N i N i++ i++ i HP[i] = sc.nextLong(); HP[i] = sc.nextLong() HP[i] HP i sc.nextLong() sc.nextLong sc if(K >= N)
      sum = 0;
    else{
		Arrays.sort(HP, Collections.reverseOrder());
       for(int i = K; i<N; i++){
         sum += HP[i];
       }
    } K >= N K N sum = 0 sum 0 {
		Arrays.sort(HP, Collections.reverseOrder());
       for(int i = K; i<N; i++){
         sum += HP[i];
       }
    } Arrays.sort(HP, Collections.reverseOrder()) Arrays.sort Arrays HP Collections.reverseOrder() Collections.reverseOrder Collections for(int i = K; i<N; i++){
         sum += HP[i];
       } int i = K; int i = K; i K i<N i N i++ i++ i {
         sum += HP[i];
       } {
         sum += HP[i];
       } sum += HP[i] sum HP[i] HP i System.out.println(sum) System.out.println System.out System System.out sum String[] args args public class Main{
  public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    long sum  =0;
    Long[] HP = new Long[N];
    for(int i=0; i<N; i++)
      HP[i] = sc.nextLong();
    
    if(K >= N)
      sum = 0;
    else{
		Arrays.sort(HP, Collections.reverseOrder());
       for(int i = K; i<N; i++){
         sum += HP[i];
       }
    }
    System.out.println(sum);
    
    
  }
} public class Main{
  public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    long sum  =0;
    Long[] HP = new Long[N];
    for(int i=0; i<N; i++)
      HP[i] = sc.nextLong();
    
    if(K >= N)
      sum = 0;
    else{
		Arrays.sort(HP, Collections.reverseOrder());
       for(int i = K; i<N; i++){
         sum += HP[i];
       }
    }
    System.out.println(sum);
    
    
  }
} Main
import java.util.Scanner;
import java.util.Arrays;
import java.util.Collections;
public class Main{
  public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
    int N = sc.nextInt();
    int K = sc.nextInt();
    long sum  =0;
    Long[] HP = new Long[N];
    for(int i=0; i<N; i++)
      HP[i] = sc.nextLong();
    
    if(K >= N)
      sum = 0;
    else{
		Arrays.sort(HP, Collections.reverseOrder());
       for(int i = K; i<N; i++){
         sum += HP[i];
       }
    }
    System.out.println(sum);
    
    
  }
}
