import java.util.Arrays;
import java.util.Collections;
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();
   Integer a[] = new Integer[N];
   for(int i=0; i<N; i++){
	   a[i] = sc.nextInt();
   }
   long sum = 0;
   Arrays.sort(a, Collections.reverseOrder());
   if(K > N) {K = N;}
   for(int i=0; i<K; i++){
	   a[i] = 0;
   }

   for(int i=0; i<N; i++) {
	   sum += a[i];
   }

   System.out.println(sum);

   }
} import java.util.Arrays; Arrays java.util import java.util.Collections; Collections 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();
   Integer a[] = new Integer[N];
   for(int i=0; i<N; i++){
	   a[i] = sc.nextInt();
   }
   long sum = 0;
   Arrays.sort(a, Collections.reverseOrder());
   if(K > N) {K = N;}
   for(int i=0; i<K; i++){
	   a[i] = 0;
   }

   for(int i=0; i<N; i++) {
	   sum += a[i];
   }

   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();
   Integer a[] = new Integer[N];
   for(int i=0; i<N; i++){
	   a[i] = sc.nextInt();
   }
   long sum = 0;
   Arrays.sort(a, Collections.reverseOrder());
   if(K > N) {K = N;}
   for(int i=0; i<K; i++){
	   a[i] = 0;
   }

   for(int i=0; i<N; i++) {
	   sum += a[i];
   }

   System.out.println(sum);

   } main {
   Scanner sc = new Scanner(System.in);
   int N = sc.nextInt();
   int K = sc.nextInt();
   Integer a[] = new Integer[N];
   for(int i=0; i<N; i++){
	   a[i] = sc.nextInt();
   }
   long sum = 0;
   Arrays.sort(a, Collections.reverseOrder());
   if(K > N) {K = N;}
   for(int i=0; i<K; i++){
	   a[i] = 0;
   }

   for(int i=0; i<N; i++) {
	   sum += a[i];
   }

   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 Integer a[] = new Integer[N]; a new Integer[N] N for(int i=0; i<N; i++){
	   a[i] = sc.nextInt();
   } int i=0; int i=0; i 0 i<N i N i++ i++ i {
	   a[i] = sc.nextInt();
   } {
	   a[i] = sc.nextInt();
   } a[i] = sc.nextInt() a[i] a i sc.nextInt() sc.nextInt sc long sum = 0; sum 0 Arrays.sort(a, Collections.reverseOrder()) Arrays.sort Arrays a Collections.reverseOrder() Collections.reverseOrder Collections if(K > N) {K = N;} K > N K N {K = N;} K = N K N for(int i=0; i<K; i++){
	   a[i] = 0;
   } int i=0; int i=0; i 0 i<K i K i++ i++ i {
	   a[i] = 0;
   } {
	   a[i] = 0;
   } a[i] = 0 a[i] a i 0 for(int i=0; i<N; i++) {
	   sum += a[i];
   } int i=0; int i=0; i 0 i<N i N 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 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();
   Integer a[] = new Integer[N];
   for(int i=0; i<N; i++){
	   a[i] = sc.nextInt();
   }
   long sum = 0;
   Arrays.sort(a, Collections.reverseOrder());
   if(K > N) {K = N;}
   for(int i=0; i<K; i++){
	   a[i] = 0;
   }

   for(int i=0; i<N; i++) {
	   sum += a[i];
   }

   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();
   Integer a[] = new Integer[N];
   for(int i=0; i<N; i++){
	   a[i] = sc.nextInt();
   }
   long sum = 0;
   Arrays.sort(a, Collections.reverseOrder());
   if(K > N) {K = N;}
   for(int i=0; i<K; i++){
	   a[i] = 0;
   }

   for(int i=0; i<N; i++) {
	   sum += a[i];
   }

   System.out.println(sum);

   }
} Main
import java.util.Arrays;
import java.util.Collections;
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();
   Integer a[] = new Integer[N];
   for(int i=0; i<N; i++){
	   a[i] = sc.nextInt();
   }
   long sum = 0;
   Arrays.sort(a, Collections.reverseOrder());
   if(K > N) {K = N;}
   for(int i=0; i<K; i++){
	   a[i] = 0;
   }

   for(int i=0; i<N; i++) {
	   sum += a[i];
   }

   System.out.println(sum);

   }
}
