Maximise Sum

You have an array $A = [A_1, A_2, \ldots, A_N]$ of size $N$. Perform **exactly** $K$ operations of the type: Pick index $i$ ($1 \le i \le N$) and, - If $A_i$ is even, replace $A_i$ by $\frac{A_i}{2}$ - If $A_i$ is odd, replace $A_i$ by $A_i+1$ Find the maximum possible sum of the array $A$ after all $K$ operations are complete. Note that you aren't allowed to skip operations. ### Input - The