Oracle

Minimum Sum After K Halvings (Max-Heap)

Members only

Given a non-negative integer array and an integer `k`, repeatedly pick one element and replace it with `ceil(element / 2)`. After at most `k` operations, minimise the remaining sum. Asked as the third...