Missing Coin Sum

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

typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll,ll> pl;


typedef long double C;
typedef complex<C> P;
#define X real()
#define Y imag()

#define sz(x) (ll)(x).size()

#define F first
#define S second
#define PB push_back
#define MP make_pair

#define REP(i,a,b) for (ll i = a; i < b; i++)



int main() {
    ll n;
    cin >> n;

    ll coin[n];
    REP(i,0,n) {
        cin >> coin[i];
    }

    sort(coin, coin+n);

    ll small_sum = 0;
    REP(i,0,n) {
        if(coin[i] <= small_sum + 1) {
            small_sum += coin[i];
        } else {
            cout << small_sum+1 << endl;
            return 0;
        }

    }
    cout << small_sum+1 << 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

Test 10

Verdict: ACCEPTED