You are given an integer array piles, where piles[i] represents the number of stones in the $i^{ ext{th}}$ pile, and an integer k.

You must perform the following operation exactly k times:

Choose any pile piles[i] and remove $\lfloor$ piles[i] $/ 2 \rfloor$ stones from it.

Return the minimum possible total number of stones remaining after performing the operation k times.

Note: $\lfloor x \rfloor$ denotes the floor function, representing the greatest integer less than or equal to $x$. You can apply the operation to the same pile multiple times.

Constraints:

• $1 \leq$ piles.length $\leq 10^5$

• $1 \leq$ piles[i] $\leq 10^4$

• $1 \leq$ k $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.