Missing Coin Sum

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

using ll = long long int;

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

    sort(coins.begin(), coins.end());

    ll smallest_missing = 1;

    for (int i = 0; i < n; i++) {
        if (coins[i] > smallest_missing) {
            break;
        }
        smallest_missing += coins[i];
    }

    cout << smallest_missing << endl;
}

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