1046_Last-Stone-Weight.cpp

class Solution {
public:
    int lastStoneWeight(vector<int>& stones) {
        priority_queue<int> pq;
        for(int ele:stones) pq.push(ele);
        while(pq.size()>1){
            int a = pq.top(); pq.pop();
            int b = pq.top(); pq.pop();

            if(a!=b) pq.push(a-b);
        }
        return (pq.size()==1) ? pq.top():0;
    }
};