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();
    long[] a=new long[n];
    for(int i=0;i<n;++i){
      a[i]=sc.nextInt();
    }
    if(k>=n){
      System.out.println("0");
    }
    else{
      Arrays.sort(a);
      int temp=n-k-1;
      long ans=0;
      for(int i=0;i<=temp;++i){
      	ans+=a[i];
      }
      System.out.println(ans);
    }
  }
} 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();
    long[] a=new long[n];
    for(int i=0;i<n;++i){
      a[i]=sc.nextInt();
    }
    if(k>=n){
      System.out.println("0");
    }
    else{
      Arrays.sort(a);
      int temp=n-k-1;
      long ans=0;
      for(int i=0;i<=temp;++i){
      	ans+=a[i];
      }
      System.out.println(ans);
    }
  }
} 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.nextInt();
    }
    if(k>=n){
      System.out.println("0");
    }
    else{
      Arrays.sort(a);
      int temp=n-k-1;
      long ans=0;
      for(int i=0;i<=temp;++i){
      	ans+=a[i];
      }
      System.out.println(ans);
    }
  } 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.nextInt();
    }
    if(k>=n){
      System.out.println("0");
    }
    else{
      Arrays.sort(a);
      int temp=n-k-1;
      long ans=0;
      for(int i=0;i<=temp;++i){
      	ans+=a[i];
      }
      System.out.println(ans);
    }
  } 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.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 if(k>=n){
      System.out.println("0");
    }
    else{
      Arrays.sort(a);
      int temp=n-k-1;
      long ans=0;
      for(int i=0;i<=temp;++i){
      	ans+=a[i];
      }
      System.out.println(ans);
    } k>=n k n {
      System.out.println("0");
    } System.out.println("0") System.out.println System.out System System.out "0" {
      Arrays.sort(a);
      int temp=n-k-1;
      long ans=0;
      for(int i=0;i<=temp;++i){
      	ans+=a[i];
      }
      System.out.println(ans);
    } Arrays.sort(a) Arrays.sort Arrays a int temp=n-k-1; temp n-k-1 n-k-1 n k 1 long ans=0; ans 0 for(int i=0;i<=temp;++i){
      	ans+=a[i];
      } int i=0; int i=0; i 0 i<=temp i temp ++i ++i i {
      	ans+=a[i];
      } {
      	ans+=a[i];
      } ans+=a[i] ans a[i] a i System.out.println(ans) System.out.println System.out System System.out ans 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.nextInt();
    }
    if(k>=n){
      System.out.println("0");
    }
    else{
      Arrays.sort(a);
      int temp=n-k-1;
      long ans=0;
      for(int i=0;i<=temp;++i){
      	ans+=a[i];
      }
      System.out.println(ans);
    }
  }
} 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.nextInt();
    }
    if(k>=n){
      System.out.println("0");
    }
    else{
      Arrays.sort(a);
      int temp=n-k-1;
      long ans=0;
      for(int i=0;i<=temp;++i){
      	ans+=a[i];
      }
      System.out.println(ans);
    }
  }
} Main
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();
    long[] a=new long[n];
    for(int i=0;i<n;++i){
      a[i]=sc.nextInt();
    }
    if(k>=n){
      System.out.println("0");
    }
    else{
      Arrays.sort(a);
      int temp=n-k-1;
      long ans=0;
      for(int i=0;i<=temp;++i){
      	ans+=a[i];
      }
      System.out.println(ans);
    }
  }
}
