LeetCode 1046. 最后一块石头的重量（priority_queue 堆）

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