Missing Coin Sum

#include <iostream>
#include <vector>
#include <algorithm>
 
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  int n;
  std::cin >> n;
  std::vector<int> x(n);
  for (int i = 1; i <= n; i++) {
    std::cin >> x[i - 1];
  }
  std::sort(x.begin(), x.end());
  long long y = 0;
  for (int i = 0; i < n; i++) {
    if (x[i] > y + 1) {
      std::cout << y + 1 << '\n';
      return 0;
    }
    y += x[i];
  }
  std::cout << y + 1 << '\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: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED