submission beats 100% of other submissions' runtime.
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    public int getMaximumConsecutive(int[] coins) {\n        Arrays.sort(coins);\n        int maxv = 1;\n        for (int c : coins) {\n            if (c > maxv)\n                break;\n\n            maxv += c;\n        }\n        return maxv;\n    }\n}\n```
['Java']