题目：​​原题链接​​（中等）

标签：排序、贪心算法

解法一：

class Solution:
    def getMaximumConsecutive(self, coins: List[int]) -> int:
        coins.sort()
        now = 0
        for coin in coins:
            if coin > now + 1:
                return now + 1
            else:
                now += coin
        return now + 1