Missing Coin Sum

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

const int N = 2e5+4;
vector<ll> a(N);

int main() {
	int n;
	cin >> n;
	for (int i=0; i<n; i++) cin >> a[i];
	sort(a.begin(), a.begin()+n);
	ll t = 0;
	for (int i=0; i<n; i++) {
		if (t < a[i]-1) {
			cout << t+1 << endl;
			return 0;
		}
		t += a[i];
	}
	cout << t+1 << endl;
	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: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED