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;
    ll crt_sum = 1;
    ll i = 0;
    while(i < n) {
        if(crt_sum == small_sum) {
            crt_sum += 1;
        }
        if(crt_sum == coin[i]) {
            crt_sum += 1;
            small_sum += coin[i];
            i++;
            continue;
        }
        if(crt_sum > small_sum) {
            small_sum += coin[i];
            i++;
            continue;
        }
        if(crt_sum < small_sum) {
            ll k = 0;
            ll tmp_sum = small_sum;
            bool find = false;
            while(k != i) {
                tmp_sum -= coin[k];
                k++;
                if(tmp_sum == crt_sum) {
                    find = true;
                    crt_sum += 1;
                    break;
                }
            }
            if(!find) {
                cout << crt_sum << endl;
                return 0;
            } else {

            }
        }
    }
    cout << crt_sum << endl;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER