Take Gifts From the Richest Pile

LeetCode 2558 • Easy • Heaps

gifts = [25,64,9,4,100], k = 4 → 29. Each second: take richest pile, leave ⌊√x⌋.

TimeO(n + k log n)

SpaceO(n)

sec: 0/4popped: —push √: —sum: —

Max (pop)

Push ⌊√x⌋

Heap pile

heap[ ]

k left4

Speed:

Ready

Press Play or Step to walk the algorithm.

Whiteboard

Size:3

Type It

Practice until you don't need to look.

═══ TAKE GIFTS (RICHEST PILE) ═══

PATTERN ▸ Max-heap O(n + k log n)

① Heapify gifts as max-heap

Python: store negatives

② k times: pop max → push ⌊√x⌋

③ Return sum of remaining piles

your implementation

Verify: