Easy C++ || MaxHeap Solution
\nclass Solution {\npublic:\n    int fillCups(vector<int>& amount) {\n        priority_queue<int> q;\n        for(auto i:amount)\n            q.push(i);\n      
```\nclass Solution {\npublic:\n    int fillCups(vector<int>& amount) {\n        priority_queue<int> q;\n        for(auto i:amount)\n            q.push(i);\n        \n        int ans = 0;\n        while(q.top()!=0){\n            int a = q.top();\n            q.pop();\n            int b = q.top();\n            q.pop();\n            if(a>0 and b>0){\n                q.push(--a);\n                q.push(--b);\n                ans++;\n            }else{\n                q.push(--a);\n                q.push(b);\n                ans++;\n            }\n        }\n        \n        return ans;\n    }\n};\n```
['C', 'Heap (Priority Queue)']