Tag: LeetCode: 1046 Last Stone Weight

You are given an array of integers stones where stones[i] is the weight of the i-th stone. We are playing a game with the stones. On each turn, we choose the two heaviest stones and smash them together. Suppose the heaviest stone has a weight x and the second heaviest…