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