{"problem":{"name":"Fennec vs Monster","description":{"content":"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 decreas","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc153_c"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $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.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$H_1$ $...$ $H_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc153_c","tags":[],"sample_group":[["3 1\n4 1 5","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."],["8 9\n7 9 3 2 3 8 4 6","0\n\nShe can use Special Move on all the monsters."],["3 0\n1000000000 1000000000 1000000000","3000000000\n\nWatch out for overflow."]],"created_at":"2026-03-03 11:01:13"}}