Java Solution
\nclass Solution {\n    public int getMaximumConsecutive(int[] coins) {\n        Arrays.sort(coins);\n        int x = 0;\n\t\tfor (int v: coins) {\n\t\t\tif (v 
```\nclass Solution {\n    public int getMaximumConsecutive(int[] coins) {\n        Arrays.sort(coins);\n        int x = 0;\n\t\tfor (int v: coins) {\n\t\t\tif (v <=x+) \n\t\t\t    x +=v;\n\t\t\telse\n\t\t\t  break;\n\t\t}\n\t\treturn x+1;\n    }\n}\n```
[]