consecutive
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 {\npublic:\n    int getMaximumConsecutive(vector<int>& coins) {\n        sort(coins.begin(),coins.end());\n        int ans=0;\n        int curr=1;\n        int n=coins.size();\n        for( int i=0;i<n;i++){\n           if(curr==coins[i]){\n               \n               curr*=2;\n               ans=curr-1;\n           }\n           else if(curr>coins[i]){\n               curr+=coins[i];\n               ans=curr-1;\n           }\n           else {\n               break;\n           }\n        }\n        return ans+1;\n        \n    }\n};\n```
['Greedy', 'Sorting', 'C++']