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();
		long A[] = new long[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextLong();
		}
		Arrays.parallelSort(A);
		long sum =0;
		for(int i=0;i<N-K;i++) {
			sum +=A[i];
		}
		System.out.println(sum);
		return ;
	}
} 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();
		long A[] = new long[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextLong();
		}
		Arrays.parallelSort(A);
		long sum =0;
		for(int i=0;i<N-K;i++) {
			sum +=A[i];
		}
		System.out.println(sum);
		return ;
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N =  sc.nextInt();
		int K = sc.nextInt();
		long A[] = new long[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextLong();
		}
		Arrays.parallelSort(A);
		long sum =0;
		for(int i=0;i<N-K;i++) {
			sum +=A[i];
		}
		System.out.println(sum);
		return ;
	} main {
		Scanner sc = new Scanner(System.in);
		int N =  sc.nextInt();
		int K = sc.nextInt();
		long A[] = new long[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextLong();
		}
		Arrays.parallelSort(A);
		long sum =0;
		for(int i=0;i<N-K;i++) {
			sum +=A[i];
		}
		System.out.println(sum);
		return ;
	} 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 A[] = new long[N]; A new long[N] N for(int i=0;i<N;i++) {
			A[i] = sc.nextLong();
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			A[i] = sc.nextLong();
		} {
			A[i] = sc.nextLong();
		} A[i] = sc.nextLong() A[i] A i sc.nextLong() sc.nextLong sc Arrays.parallelSort(A) Arrays.parallelSort Arrays A long sum =0; sum 0 for(int i=0;i<N-K;i++) {
			sum +=A[i];
		} int i=0; int i=0; i 0 i<N-K i N-K N K i++ i++ i {
			sum +=A[i];
		} {
			sum +=A[i];
		} sum +=A[i] sum A[i] A i System.out.println(sum) System.out.println System.out System System.out sum return ; 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 A[] = new long[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextLong();
		}
		Arrays.parallelSort(A);
		long sum =0;
		for(int i=0;i<N-K;i++) {
			sum +=A[i];
		}
		System.out.println(sum);
		return ;
	}
} public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N =  sc.nextInt();
		int K = sc.nextInt();
		long A[] = new long[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextLong();
		}
		Arrays.parallelSort(A);
		long sum =0;
		for(int i=0;i<N-K;i++) {
			sum +=A[i];
		}
		System.out.println(sum);
		return ;
	}
} 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();
		long A[] = new long[N];
		for(int i=0;i<N;i++) {
			A[i] = sc.nextLong();
		}
		Arrays.parallelSort(A);
		long sum =0;
		for(int i=0;i<N-K;i++) {
			sum +=A[i];
		}
		System.out.println(sum);
		return ;
	}
}