import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ABC153_c solver = new ABC153_c();
        solver.solve(1, in, out);
        out.close();
    }

    static class ABC153_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            long H[] = new long[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();

            }
            Arrays.sort(H);
            long att = 0;
            for (int i = N - K - 1; i >= 0; i--) {
                att += H[i];
            }
            out.println(att);
        }

    }
}
 import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.Arrays; Arrays java.util import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ABC153_c solver = new ABC153_c();
        solver.solve(1, in, out);
        out.close();
    }

    static class ABC153_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            long H[] = new long[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();

            }
            Arrays.sort(H);
            long att = 0;
            for (int i = N - K - 1; i >= 0; i--) {
                att += H[i];
            }
            out.println(att);
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ABC153_c solver = new ABC153_c();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ABC153_c solver = new ABC153_c();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out Scanner in = new Scanner(inputStream); in new Scanner(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) ABC153_c solver = new ABC153_c(); solver new ABC153_c() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class ABC153_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            long H[] = new long[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();

            }
            Arrays.sort(H);
            long att = 0;
            for (int i = N - K - 1; i >= 0; i--) {
                att += H[i];
            }
            out.println(att);
        }

    } ABC153_c public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            long H[] = new long[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();

            }
            Arrays.sort(H);
            long att = 0;
            for (int i = N - K - 1; i >= 0; i--) {
                att += H[i];
            }
            out.println(att);
        } solve {
            int N = in.nextInt();
            int K = in.nextInt();
            long H[] = new long[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();

            }
            Arrays.sort(H);
            long att = 0;
            for (int i = N - K - 1; i >= 0; i--) {
                att += H[i];
            }
            out.println(att);
        } int N = in.nextInt(); N in.nextInt() in.nextInt in int K = in.nextInt(); K in.nextInt() in.nextInt in long H[] = new long[N]; H new long[N] N for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();

            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                H[i] = in.nextInt();

            } {
                H[i] = in.nextInt();

            } H[i] = in.nextInt() H[i] H i in.nextInt() in.nextInt in Arrays.sort(H) Arrays.sort Arrays H long att = 0; att 0 for (int i = N - K - 1; i >= 0; i--) {
                att += H[i];
            } int i = N - K - 1; int i = N - K - 1; i N - K - 1 N - K - 1 N K 1 i >= 0 i 0 i-- i-- i {
                att += H[i];
            } {
                att += H[i];
            } att += H[i] att H[i] H i out.println(att) out.println out att int testNumber testNumber Scanner in in PrintWriter out out public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ABC153_c solver = new ABC153_c();
        solver.solve(1, in, out);
        out.close();
    }

    static class ABC153_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            long H[] = new long[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();

            }
            Arrays.sort(H);
            long att = 0;
            for (int i = N - K - 1; i >= 0; i--) {
                att += H[i];
            }
            out.println(att);
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ABC153_c solver = new ABC153_c();
        solver.solve(1, in, out);
        out.close();
    }

    static class ABC153_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            long H[] = new long[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();

            }
            Arrays.sort(H);
            long att = 0;
            for (int i = N - K - 1; i >= 0; i--) {
                att += H[i];
            }
            out.println(att);
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        ABC153_c solver = new ABC153_c();
        solver.solve(1, in, out);
        out.close();
    }

    static class ABC153_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            int K = in.nextInt();
            long H[] = new long[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();

            }
            Arrays.sort(H);
            long att = 0;
            for (int i = N - K - 1; i >= 0; i--) {
                att += H[i];
            }
            out.println(att);
        }

    }
}

