1798. Maximum Number of Consecutive Values You Can Make

You are given an integer array coins of length n which represents the n coins that you own. The value of the ith coin is coins[i]. You can make some value x if you can choose some of your n coins such that their values sum up to x.

Return the maximum number of consecutive integer values that you can make with your coins starting from and including 0.

Note that you may have multiple coins of the same value.

class Solution {
public:
    int getMaximumConsecutive(vector<int>& A) {
        sort(begin(A),end(A));
        int ma = 0;
        for(auto& a : A) {
            if(ma + 1 < a) return ma + 1;
            ma += a;
        }
        return ma + 1;
    }
};