Leetcode 1046. Last Stone Weight

Given an array of stone weights, repeatedly take the two heaviest stones, remove them, and if their weights differ push back the difference; return the last remaining weight or 0. This is typically solved with a max-heap (priority queue) to repeatedly extract the two largest elements until at most one remains.