You are given an integer array gifts representing the number of gifts in various piles, and an integer k representing the number of operations to perform.

In each operation, you must:

• Select the pile containing the maximum number of gifts. If there are multiple piles with the maximum value, you may choose any of them.

• Replace the number of gifts in the selected pile with $\lfloor \sqrt{x} \rfloor$, where $x$ is the current number of gifts in that pile.

Return the total number of gifts remaining across all piles after performing this operation k times.

Constraints:

• $1 \leq$ gifts.length $\leq 10^3$

• $1 \leq$ gifts[i] $\leq 10^9$

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

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.