import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
	int n =  sc.nextInt();
	int k =  sc.nextInt();
	Long count =	0L;
	Integer h[] = new Integer[n];

	for(int i=0;i<n;i++) {
		h[i] = sc.nextInt();
	}
	Arrays.sort(h,  Collections.reverseOrder());

	try {
		for(int i=0;i<k;i++) {
			h[i] = 0;
		}
	}
	catch(Exception e) {}
	finally{
		for(int i=0;i<n;i++) {
			count += h[i];
		}
	}
	System.out.println(count);
  }
} import java.util.Arrays; Arrays java.util import java.util.Collections; Collections java.util import java.util.Scanner; Scanner java.util class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
	int n =  sc.nextInt();
	int k =  sc.nextInt();
	Long count =	0L;
	Integer h[] = new Integer[n];

	for(int i=0;i<n;i++) {
		h[i] = sc.nextInt();
	}
	Arrays.sort(h,  Collections.reverseOrder());

	try {
		for(int i=0;i<k;i++) {
			h[i] = 0;
		}
	}
	catch(Exception e) {}
	finally{
		for(int i=0;i<n;i++) {
			count += h[i];
		}
	}
	System.out.println(count);
  }
} Main public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
	int n =  sc.nextInt();
	int k =  sc.nextInt();
	Long count =	0L;
	Integer h[] = new Integer[n];

	for(int i=0;i<n;i++) {
		h[i] = sc.nextInt();
	}
	Arrays.sort(h,  Collections.reverseOrder());

	try {
		for(int i=0;i<k;i++) {
			h[i] = 0;
		}
	}
	catch(Exception e) {}
	finally{
		for(int i=0;i<n;i++) {
			count += h[i];
		}
	}
	System.out.println(count);
  } main {
    Scanner sc = new Scanner(System.in);
	int n =  sc.nextInt();
	int k =  sc.nextInt();
	Long count =	0L;
	Integer h[] = new Integer[n];

	for(int i=0;i<n;i++) {
		h[i] = sc.nextInt();
	}
	Arrays.sort(h,  Collections.reverseOrder());

	try {
		for(int i=0;i<k;i++) {
			h[i] = 0;
		}
	}
	catch(Exception e) {}
	finally{
		for(int i=0;i<n;i++) {
			count += h[i];
		}
	}
	System.out.println(count);
  } 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 count =	0L; count 0L Integer h[] = new Integer[n]; h new Integer[n] n 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 try {
		for(int i=0;i<k;i++) {
			h[i] = 0;
		}
	}
	catch(Exception e) {}
	finally{
		for(int i=0;i<n;i++) {
			count += h[i];
		}
	} catch(Exception e) {} Exception e {} {
		for(int i=0;i<n;i++) {
			count += h[i];
		}
	} for(int i=0;i<n;i++) {
			count += h[i];
		} int i=0; int i=0; i 0 i<n i n i++ i++ i {
			count += h[i];
		} {
			count += h[i];
		} count += h[i] count h[i] h i {
		for(int i=0;i<k;i++) {
			h[i] = 0;
		}
	} for(int i=0;i<k;i++) {
			h[i] = 0;
		} int i=0; int i=0; i 0 i<k i k i++ i++ i {
			h[i] = 0;
		} {
			h[i] = 0;
		} h[i] = 0 h[i] h i 0 System.out.println(count) System.out.println System.out System System.out count String[] args args
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
	int n =  sc.nextInt();
	int k =  sc.nextInt();
	Long count =	0L;
	Integer h[] = new Integer[n];

	for(int i=0;i<n;i++) {
		h[i] = sc.nextInt();
	}
	Arrays.sort(h,  Collections.reverseOrder());

	try {
		for(int i=0;i<k;i++) {
			h[i] = 0;
		}
	}
	catch(Exception e) {}
	finally{
		for(int i=0;i<n;i++) {
			count += h[i];
		}
	}
	System.out.println(count);
  }
}