Double Trouble

**This problem has subtasks. You will receive $30$ points for solving the $K \leq N$ case.** You're given an array $A$ containing $N$ integers. You must perform the following operation **exactly** $K$ times: - Choose an index $i$ ($1 \leq i \leq N$), and multiply $A_i$ by $2$. That is, replace $A_i$ with $2\cdot A_i$. Find the minimum possible sum of the array $A$ after all $K$ operations ha