[Python] Max heap  - Greedy solution
\nclass Solution:\n    def fillCups(self, amount: List[int]) -> int:\n        # Greedy using priority queue\n        heap = []\n        for a in amount:\n      
```\nclass Solution:\n    def fillCups(self, amount: List[int]) -> int:\n        # Greedy using priority queue\n        heap = []\n        for a in amount:\n            heapq.heappush(heap, -a)\n        seconds = 0\n        while heap[0] != 0:\n\t\t    # get the max two cup\n            max1 = heappop(heap)\n            max2 = heappop(heap)\n            seconds += 1\n            heappush(heap, max1 + 1)\n            heappush(heap, max2 + 1)\n\t\t\n        return seconds\n```
['Python']