Straightforward Python
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:\n    def getMaximumConsecutive(self, coins: List[int]) -> int:\n        # [1, 1, 3, 4, 10]\n        # 0: []\n        # 1: [1]\n        # 2: [1, 1]\n        # We have 3 and we can make up to 2 so we can make till 5\n        # 5: [1, 1, 3]\n        # We have 4 and we can make up to 5 so we can make till 9\n        # 9: [1, 1, 3, 4]\n        # We have 10 and we can make up to 9 so we can make till 19\n        # 19 + 1 = 20 (becos zero index)\n        # for the case of [1, 3]\n        # we can make up till 1 but we cant make 2 so since 3 > 2 then we break\n        coins.sort()\n        res = 1\n        for coin in coins:\n            if coin > res:\n                break\n            res += coin\n        return res\n            \n\n        \n```
['Python3']