import java.math.BigInteger;
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();
			Integer[] h = new Integer[n];
			long sum = 0;
			
			
			for(int i=0;i<n;i++) {
				h[i]=sc.nextInt();
			}
			
			Arrays.sort(h,Collections.reverseOrder());
			
			if(n<=k) {
				System.out.println(0);
				return;
			}else {
				for(int i=k;i<n;i++) {
					sum += h[i];
				}
				
				System.out.println(sum);
			}
			
			
			
			
			
		}
				
	} import java.math.BigInteger; BigInteger java.math 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();
			Integer[] h = new Integer[n];
			long sum = 0;
			
			
			for(int i=0;i<n;i++) {
				h[i]=sc.nextInt();
			}
			
			Arrays.sort(h,Collections.reverseOrder());
			
			if(n<=k) {
				System.out.println(0);
				return;
			}else {
				for(int i=k;i<n;i++) {
					sum += h[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[] h = new Integer[n];
			long sum = 0;
			
			
			for(int i=0;i<n;i++) {
				h[i]=sc.nextInt();
			}
			
			Arrays.sort(h,Collections.reverseOrder());
			
			if(n<=k) {
				System.out.println(0);
				return;
			}else {
				for(int i=k;i<n;i++) {
					sum += h[i];
				}
				
				System.out.println(sum);
			}
			
			
			
			
			
		} main {
		
			Scanner sc = new Scanner(System.in);
			int n = sc.nextInt();
			int k = sc.nextInt();
			Integer[] h = new Integer[n];
			long sum = 0;
			
			
			for(int i=0;i<n;i++) {
				h[i]=sc.nextInt();
			}
			
			Arrays.sort(h,Collections.reverseOrder());
			
			if(n<=k) {
				System.out.println(0);
				return;
			}else {
				for(int i=k;i<n;i++) {
					sum += h[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[] h = new Integer[n]; h new Integer[n] n long sum = 0; sum 0 for(int i=0;i<n;i++) {
				h[i]=sc.nextInt();
			} int i=0; int i=0; i 0 i<n i n i++ i++ i {
				h[i]=sc.nextInt();
			} {
				h[i]=sc.nextInt();
			} h[i]=sc.nextInt() h[i] h i sc.nextInt() sc.nextInt sc Arrays.sort(h,Collections.reverseOrder()) Arrays.sort Arrays h Collections.reverseOrder() Collections.reverseOrder Collections if(n<=k) {
				System.out.println(0);
				return;
			}else {
				for(int i=k;i<n;i++) {
					sum += h[i];
				}
				
				System.out.println(sum);
			} n<=k n k {
				System.out.println(0);
				return;
			} System.out.println(0) System.out.println System.out System System.out 0 return; {
				for(int i=k;i<n;i++) {
					sum += h[i];
				}
				
				System.out.println(sum);
			} for(int i=k;i<n;i++) {
					sum += h[i];
				} int i=k; int i=k; i k i<n i n i++ i++ i {
					sum += h[i];
				} {
					sum += h[i];
				} sum += h[i] sum h[i] h 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[] h = new Integer[n];
			long sum = 0;
			
			
			for(int i=0;i<n;i++) {
				h[i]=sc.nextInt();
			}
			
			Arrays.sort(h,Collections.reverseOrder());
			
			if(n<=k) {
				System.out.println(0);
				return;
			}else {
				for(int i=k;i<n;i++) {
					sum += h[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[] h = new Integer[n];
			long sum = 0;
			
			
			for(int i=0;i<n;i++) {
				h[i]=sc.nextInt();
			}
			
			Arrays.sort(h,Collections.reverseOrder());
			
			if(n<=k) {
				System.out.println(0);
				return;
			}else {
				for(int i=k;i<n;i++) {
					sum += h[i];
				}
				
				System.out.println(sum);
			}
			
			
			
			
			
		}
				
	} Main
import java.math.BigInteger;
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();
			Integer[] h = new Integer[n];
			long sum = 0;
			
			
			for(int i=0;i<n;i++) {
				h[i]=sc.nextInt();
			}
			
			Arrays.sort(h,Collections.reverseOrder());
			
			if(n<=k) {
				System.out.println(0);
				return;
			}else {
				for(int i=k;i<n;i++) {
					sum += h[i];
				}
				
				System.out.println(sum);
			}
			
			
			
			
			
		}
				
	}