Score : 300 points
Fennec is fighting with N monsters.
The health of the i-th monster is H_i.
Fennec can do the following two actions:
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.
Input is given from Standard Input in the following format:
N K H_1 ... H_N
Print the minimum number of times Fennec needs to do Attack (not counting Special Move) before winning.
3 1 4 1 5
5
By 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 7 9 3 2 3 8 4 6
0
She can use Special Move on all the monsters.
3 0 1000000000 1000000000 1000000000
3000000000
Watch out for overflow.