✅✔️Easy implementation using priority queue || max Heap✈️✈️✈️✈️✈️
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int fillCups(vector<int>& amount) {\n        priority_queue<int>pq;\n        for(auto i : amount){\n            if(i > 0) pq.push(i);\n        }\n        int ans = 0;\n        while(pq.size() > 1){\n            int type1 = pq.top(); pq.pop();\n            int type2 = pq.top(); pq.pop();\n            type1--; type2--;\n            if(type1 > 0) pq.push(type1);\n            if(type2 > 0) pq.push(type2);\n            ans++;\n        }\n        if(!pq.empty()) ans += pq.top();\n        return ans;\n    }\n};\n```
['Heap (Priority Queue)', 'C++']