{"raw_statement":[{"iden":"problem statement","content":"Fennec is fighting with $N$ monsters.\nThe _health_ of the $i$\\-th monster is $H_i$.\nFennec can do the following two actions:\n\n*   Attack: Fennec chooses one monster. That monster's health will decrease by $1$.\n*   Special Move: Fennec chooses one monster. That monster's health will become $0$.\n\nThere is no way other than Attack and Special Move to decrease the monsters' health.\nFennec wins when all the monsters' healths become $0$ or below.\nFind 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."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $0 \\leq K \\leq 2 \\times 10^5$\n*   $1 \\leq H_i \\leq 10^9$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$\n$H_1$ $...$ $H_N$"},{"iden":"sample input 1","content":"3 1\n4 1 5"},{"iden":"sample output 1","content":"5\n\nBy using Special Move on the third monster, and doing Attack four times on the first monster and once on the second monster, Fennec can win with five Attacks."},{"iden":"sample input 2","content":"8 9\n7 9 3 2 3 8 4 6"},{"iden":"sample output 2","content":"0\n\nShe can use Special Move on all the monsters."},{"iden":"sample input 3","content":"3 0\n1000000000 1000000000 1000000000"},{"iden":"sample output 3","content":"3000000000\n\nWatch out for overflow."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}