merge sort
Intuition\n Describe your first thoughts on how to solve this problem. \nmerge sort\n# Approach\n Describe your approach to solving the problem. \n\n# Complexit
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nmerge sort\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)$$ -->\nO(nlogn)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(n)\n\n# Code\n```\nclass Solution:\n    def getMaximumConsecutive(self, coins: List[int]) -> int:\n        coins.sort()\n        prev = 0\n        for c in coins:\n            if c > prev + 1:\n                return prev + 1\n            prev += c\n        return prev + 1\n        \n```
['Python3']