Python (Simple Greedy)
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):\n        n, running_sum = len(coins), 0\n\n        coins.sort()\n\n        for i in coins:\n            if i > running_sum+1:\n                return running_sum+1\n            running_sum += i \n\n        return running_sum+1\n```
['Python3']