Missing Coin Sum

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

long long smallestMissingSum(vector<int>& coins) {
    sort(coins.begin(), coins.end());
    long long current_sum = 0;

    for (int coin : coins) {
        if (coin > current_sum + 1) {
            return current_sum + 1;
        }
        current_sum += coin;
    }

    return current_sum + 1;
}

int main() {
    int n;
    cin >> n;
    vector<int> coins(n);
    for (int i = 0; i < n; i++) {
        cin >> coins[i];
    }

    cout << smallestMissingSum(coins) << endl;
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED