c++ priority_queue 100% time, short easy to understand
\npriority_queue<int> pq(v.begin(),v.end());\n        \n        while(true)\n        {\n            if(pq.size() ==0)   return 0;\n            if(pq.size() ==1)
```\npriority_queue<int> pq(v.begin(),v.end());\n        \n        while(true)\n        {\n            if(pq.size() ==0)   return 0;\n            if(pq.size() ==1)   return pq.top();\n            int a = pq.top();\n            pq.pop();\n            int b = pq.top();\n            pq.pop();\n            if(a!=b)    pq.push(abs(a-b));\n        }\n```
['C', 'Heap (Priority Queue)']