Missing Coin Sum

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    ll n;
    cin >> n;
    
    vector<ll> coins(n);
    for(auto &coin : coins){
        cin >> coin;
    }
    
    // Sort the coins in non-decreasing order
    sort(coins.begin(), coins.end());
    
    ll smallest_sum = 1; // Initialize the smallest unconstructible sum
    
    for(int i = 0; i < n; ++i){
        if(coins[i] > smallest_sum){
            // Cannot form the smallest_sum with the current set of coins
            break;
        }
        smallest_sum += coins[i];
    }
    
    cout << smallest_sum;
}

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