链接 : 登录—专业IT笔试面试备考平台_牛客网
There are nnn monsters in the forest. The iii-th one has a defense value of aia_iai.
You can perform the following attacks:
1. Decrease all monsters' defense values by 1.
2. Choose a monster and let its defense value aia_iai be ⌊aik⌋\lfloor\frac{a_i}{k}\rfloor⌊kai⌋, where kkk is given.
Find the minimum number of operations required to make the defense value of each monster less than or eqaul to 0.
输入描述:
Line 1: Two integers n,k.
Line 2: nnn integers, indicating sequence a.
输出描述:
Line 1: An integer, the answer.
示例1
输入:
5 2
1 3 5 7 9
输出:
7
示例2
输入:<