120C.md (1368B)
1 Source: https://codeforces.com/problemset/problem/120/C 2 3 C. Winnie-the-Pooh and honey 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 input.txt 16 17 output 18 19 output.txt 20 21 As we all know, Winnie-the-Pooh just adores honey. Ones he and the Piglet found out that the Rabbit has recently gotten hold of an impressive amount of this sweet and healthy snack. As you may guess, Winnie and the Piglet asked to come at the Rabbit's place. Thus, there are *n* jars of honey lined up in front of Winnie-the-Pooh, jar number *i* contains *a**i* kilos of honey. Winnie-the-Pooh eats the honey like that: each time he chooses a jar containing most honey. If the jar has less that *k* kilos of honey or if Winnie-the-Pooh has already eaten from it three times, he gives the jar to Piglet. Otherwise he eats exactly *k* kilos of honey from the jar and puts it back. Winnie does so until he gives all jars to the Piglet. Count how much honey Piglet will overall get after Winnie satisfies his hunger. 22 23 Input 24 25 The first line contains two integers *n* and *k* (1 ≤ *n* ≤ 100, 1 ≤ *k* ≤ 100). The second line contains *n* integers *a*1, *a*2, ..., *a**n*, separated by spaces (1 ≤ *a**i* ≤ 100). 26 27 Output 28 29 Print a single number — how many kilos of honey gets Piglet. 30 31 Examples 32 33 Input 34 35 ``` 36 3 3 37 15 8 10 38 ``` 39 40 Output 41 42 ``` 43 9 44 ```