[Python] Sorting Based
Approach\n- Continously sort and decrement the first and second value by 1 till the first value is 0. Later return the count\n\nCode\n\nclass Solution:\n    def
Approach\n- Continously sort and decrement the first and second value by 1 till the first value is 0. Later return the count\n\nCode\n```\nclass Solution:\n    def fillCups(self, amount: List[int]) -> int:\n        \n        count = 0\n        amount = sorted(amount, reverse=True)\n        while amount[0] > 0:\n            amount[0] -= 1\n            amount[1] -= 1\n            count += 1\n            amount = sorted(amount, reverse=True)\n        return count\n```\n\n
['Python']