Take Gifts From the Richest Pile

Repeatedly for k seconds, pick the current largest pile, replace its size with floor(sqrt(size)), and return the total remaining gifts; the core challenge is efficiently selecting and updating the maximum (use a max-heap / priority queue for O(k log n) operations).