Missing Coin Sum

#include <bits/stdc++.h>

const int N = 2e5+1;

using namespace std;

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;

    long long coins[N];

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

    sort(coins, coins+n);

    long long v = 1;
    
    for(const auto& c : coins) {
        if (c > v) {
            break;
        }

        v += c;
    }

    cout << v << '\n';

    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: WRONG ANSWER

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED