output_description: Print the minimum number of times Fennec needs to do Attack (not counting
  Special Move) before winning.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
      H_1 ... H_N
attempt: # -*- coding: utf-8 -*-
  
  import sys
  
  
  def input():
      return sys.stdin.readline().strip()
  
  
  def list2d(a, b, c):
      return [[c] * b for i in range(a)]
  
  
  def list3d(a, b, c, d):
      return [[[d] * c for j in range(b)] for i in range(a)]
  
  
  def list4d(a, b, c, d, e):
      return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
  
  
  def ceil(x, y=1):
      return int(-(-x // y))
  
  
  def INT():
      return int(input())
  
  
  def MAP():
      return map(int, input().split())
  
  
  def LIST(N=None):
      return list(MAP()) if N is None else [INT() for i in range(N)]
  
  
  def Yes():
      print("Yes")
  
  
  def No():
      print("No")
  
  
  def YES():
      print("YES")
  
  
  def NO():
      print("NO")
  
  
  sys.setrecursionlimit(10**9)
  INF = 10**18
  MOD = 10**9 + 7
  
  N, K = MAP()
  A = sorted(LIST(), reverse=1)
  
  if K >= N:
      print(0)
      exit()
  
  A = A[K:]
  print(sum(A))
  
problem_description: Statement
  
  Fennec is fighting with N monsters.
  
  The _health_ of the i-th monster is H_i.
  
  Fennec can do the following two actions:
  
    * Attack: Fennec chooses one monster. That monster's health will decrease by 1.
    * Special Move: Fennec chooses one monster. That monster's health will become 0.
  
  There is no way other than Attack and Special Move to decrease the monsters'
  health.
  
  Fennec wins when all the monsters' healths become 0 or below.
  
  Find the minimum number of times Fennec needs to do Attack (not counting
  Special Move) before winning when she can use Special Move at most K times.
samples: [{"input": "3 1\n    4 1 5", "output": "5\n    \n\nBy using Special Move on the third monster, and doing Attack four times on the\nfirst monster and once on the second monster, Fennec can win with five\nAttacks.\n\n* * *"}, {"input": "8 9\n    7 9 3 2 3 8 4 6", "output": "0\n    \n\nShe can use Special Move on all the monsters.\n\n* * *"}, {"input": "3 0\n    1000000000 1000000000 1000000000", "output": "3000000000\n    \n\nWatch out for overflow."}]