C++ easy Priority queue solution || 100% time
\nint lastStoneWeight(vector<int>& stones) {\n\n\tpriority_queue<int>pq;\n\tfor(auto x: stones)\n\t{\n\t\tpq.push(x);\n\t}\n\n\twhile(!p.empty())\n\t{\n\t\tint 
```\nint lastStoneWeight(vector<int>& stones) {\n\n\tpriority_queue<int>pq;\n\tfor(auto x: stones)\n\t{\n\t\tpq.push(x);\n\t}\n\n\twhile(!p.empty())\n\t{\n\t\tint y = pq.top();\n\t\tif(pq.size()==1)return y;\n\t\tpq.pop();\n\t\tint rem = abs(y - pq.top());\n\t\tpq.pop();\n\t\tpq.push(rem);\n\n        }\n        return 0;\n    }\n\t\n```
['C', 'Heap (Priority Queue)', 'C++']