Class Solution

1046. Last Stone Weight/Solution.cpp:14–27

using namespace std;

class Solution {
public:
    int lastStoneWeight(vector<int>& stones) {
        priority_queue<int> pq (stones.begin(), stones.end());
        while (pq.size() >= 2) {
            int x = pq.top(); pq.pop();
            int y = pq.top(); pq.pop();
            if (x > y) {
                pq.push(x - y);
            }
        }
        return pq.size() == 0 ? 0 : pq.top();
    }
};


int main() {