import java.util.Arrays;
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();
        if(N <= K){
            System.out.println(0);
            return;
        }
        long[] H = new long[N];
        long sum = 0;
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextLong();
            sum+= H[i];
        }
        Arrays.sort(H);
        int k = H.length -1;
        while (0 < K ){
            sum = sum - H[k];
            k--;
            K--;
        }
        System.out.println(sum);
    }
} import java.util.Arrays; Arrays java.util import java.util.Scanner; Scanner 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();
        if(N <= K){
            System.out.println(0);
            return;
        }
        long[] H = new long[N];
        long sum = 0;
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextLong();
            sum+= H[i];
        }
        Arrays.sort(H);
        int k = H.length -1;
        while (0 < K ){
            sum = sum - H[k];
            k--;
            K--;
        }
        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();
        if(N <= K){
            System.out.println(0);
            return;
        }
        long[] H = new long[N];
        long sum = 0;
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextLong();
            sum+= H[i];
        }
        Arrays.sort(H);
        int k = H.length -1;
        while (0 < K ){
            sum = sum - H[k];
            k--;
            K--;
        }
        System.out.println(sum);
    } main {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        if(N <= K){
            System.out.println(0);
            return;
        }
        long[] H = new long[N];
        long sum = 0;
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextLong();
            sum+= H[i];
        }
        Arrays.sort(H);
        int k = H.length -1;
        while (0 < K ){
            sum = sum - H[k];
            k--;
            K--;
        }
        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 if(N <= K){
            System.out.println(0);
            return;
        } N <= K N K {
            System.out.println(0);
            return;
        } System.out.println(0) System.out.println System.out System System.out 0 return; long[] H = new long[N]; H new long[N] N long sum = 0; sum 0 for (int i = 0; i < N; i++) {
            H[i] = sc.nextLong();
            sum+= H[i];
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            H[i] = sc.nextLong();
            sum+= H[i];
        } {
            H[i] = sc.nextLong();
            sum+= H[i];
        } H[i] = sc.nextLong() H[i] H i sc.nextLong() sc.nextLong sc sum+= H[i] sum H[i] H i Arrays.sort(H) Arrays.sort Arrays H int k = H.length -1; k H.length -1 H.length H H.length 1 while (0 < K ){
            sum = sum - H[k];
            k--;
            K--;
        } 0 < K 0 K {
            sum = sum - H[k];
            k--;
            K--;
        } sum = sum - H[k] sum sum - H[k] sum H[k] H k k-- k K-- K 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();
        if(N <= K){
            System.out.println(0);
            return;
        }
        long[] H = new long[N];
        long sum = 0;
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextLong();
            sum+= H[i];
        }
        Arrays.sort(H);
        int k = H.length -1;
        while (0 < K ){
            sum = sum - H[k];
            k--;
            K--;
        }
        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();
        if(N <= K){
            System.out.println(0);
            return;
        }
        long[] H = new long[N];
        long sum = 0;
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextLong();
            sum+= H[i];
        }
        Arrays.sort(H);
        int k = H.length -1;
        while (0 < K ){
            sum = sum - H[k];
            k--;
            K--;
        }
        System.out.println(sum);
    }
} Main
import java.util.Arrays;
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();
        if(N <= K){
            System.out.println(0);
            return;
        }
        long[] H = new long[N];
        long sum = 0;
        for (int i = 0; i < N; i++) {
            H[i] = sc.nextLong();
            sum+= H[i];
        }
        Arrays.sort(H);
        int k = H.length -1;
        while (0 < K ){
            sum = sum - H[k];
            k--;
            K--;
        }
        System.out.println(sum);
    }
}