import java.util.Scanner;
import java.util.List;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Arrays;
import java.util.Collections;
import java.util.*;
class Main{
  public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    int N = scan.nextInt();
    int K = scan.nextInt();
    Integer H[] = new Integer[N];
    long count = 0;
    for (int i = 0; i < N; i++) {
      H[i] = scan.nextInt();
    }
    Arrays.sort(H, Collections.reverseOrder());
    if (K - N > 0) {
      for (int i = 0; i < N; i++) {
        H[i] = 0;
      }
    }
    else{
      for (int i = 0; i < K; i++) {
        H[i] = 0;
      }
      for (int i = K; i < N; i++) {
        count += H[i];
      }
    }
    System.out.println(count);
  }
}

 import java.util.Scanner; Scanner java.util import java.util.List; List java.util import java.util.ArrayList; ArrayList java.util import java.util.Comparator; Comparator java.util import java.util.Arrays; Arrays java.util import java.util.Collections; Collections java.util import java.util.*; util.* java class Main{
  public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    int N = scan.nextInt();
    int K = scan.nextInt();
    Integer H[] = new Integer[N];
    long count = 0;
    for (int i = 0; i < N; i++) {
      H[i] = scan.nextInt();
    }
    Arrays.sort(H, Collections.reverseOrder());
    if (K - N > 0) {
      for (int i = 0; i < N; i++) {
        H[i] = 0;
      }
    }
    else{
      for (int i = 0; i < K; i++) {
        H[i] = 0;
      }
      for (int i = K; i < N; i++) {
        count += H[i];
      }
    }
    System.out.println(count);
  }
} Main public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    int N = scan.nextInt();
    int K = scan.nextInt();
    Integer H[] = new Integer[N];
    long count = 0;
    for (int i = 0; i < N; i++) {
      H[i] = scan.nextInt();
    }
    Arrays.sort(H, Collections.reverseOrder());
    if (K - N > 0) {
      for (int i = 0; i < N; i++) {
        H[i] = 0;
      }
    }
    else{
      for (int i = 0; i < K; i++) {
        H[i] = 0;
      }
      for (int i = K; i < N; i++) {
        count += H[i];
      }
    }
    System.out.println(count);
  } main {
    Scanner scan = new Scanner(System.in);
    int N = scan.nextInt();
    int K = scan.nextInt();
    Integer H[] = new Integer[N];
    long count = 0;
    for (int i = 0; i < N; i++) {
      H[i] = scan.nextInt();
    }
    Arrays.sort(H, Collections.reverseOrder());
    if (K - N > 0) {
      for (int i = 0; i < N; i++) {
        H[i] = 0;
      }
    }
    else{
      for (int i = 0; i < K; i++) {
        H[i] = 0;
      }
      for (int i = K; i < N; i++) {
        count += H[i];
      }
    }
    System.out.println(count);
  } Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int N = scan.nextInt(); N scan.nextInt() scan.nextInt scan int K = scan.nextInt(); K scan.nextInt() scan.nextInt scan Integer H[] = new Integer[N]; H new Integer[N] N long count = 0; count 0 for (int i = 0; i < N; i++) {
      H[i] = scan.nextInt();
    } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
      H[i] = scan.nextInt();
    } {
      H[i] = scan.nextInt();
    } H[i] = scan.nextInt() H[i] H i scan.nextInt() scan.nextInt scan Arrays.sort(H, Collections.reverseOrder()) Arrays.sort Arrays H Collections.reverseOrder() Collections.reverseOrder Collections if (K - N > 0) {
      for (int i = 0; i < N; i++) {
        H[i] = 0;
      }
    }
    else{
      for (int i = 0; i < K; i++) {
        H[i] = 0;
      }
      for (int i = K; i < N; i++) {
        count += H[i];
      }
    } K - N > 0 K - N K N 0 {
      for (int i = 0; i < N; i++) {
        H[i] = 0;
      }
    } for (int i = 0; i < N; i++) {
        H[i] = 0;
      } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
        H[i] = 0;
      } {
        H[i] = 0;
      } H[i] = 0 H[i] H i 0 {
      for (int i = 0; i < K; i++) {
        H[i] = 0;
      }
      for (int i = K; i < N; i++) {
        count += H[i];
      }
    } for (int i = 0; i < K; i++) {
        H[i] = 0;
      } int i = 0; int i = 0; i 0 i < K i K i++ i++ i {
        H[i] = 0;
      } {
        H[i] = 0;
      } H[i] = 0 H[i] H i 0 for (int i = K; i < N; i++) {
        count += H[i];
      } int i = K; int i = K; i K i < N i N i++ i++ i {
        count += H[i];
      } {
        count += H[i];
      } count += H[i] count H[i] H i System.out.println(count) System.out.println System.out System System.out count String[] args args
import java.util.Scanner;
import java.util.List;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Arrays;
import java.util.Collections;
import java.util.*;
class Main{
  public static void main(String[] args){
    Scanner scan = new Scanner(System.in);
    int N = scan.nextInt();
    int K = scan.nextInt();
    Integer H[] = new Integer[N];
    long count = 0;
    for (int i = 0; i < N; i++) {
      H[i] = scan.nextInt();
    }
    Arrays.sort(H, Collections.reverseOrder());
    if (K - N > 0) {
      for (int i = 0; i < N; i++) {
        H[i] = 0;
      }
    }
    else{
      for (int i = 0; i < K; i++) {
        H[i] = 0;
      }
      for (int i = K; i < N; i++) {
        count += H[i];
      }
    }
    System.out.println(count);
  }
}


