Missing Coin Sum

typedef long long ll;
#include <algorithm>
#include <iostream>
#include <vector>
int main(){
  int n;
  std::cin >> n;
  std::vector<ll> coins(n);
  for (int i = 0; i<n; ++i) {
    std::cin >> coins[i];
  }

  std::sort(coins.begin(), coins.end());


  ll min_ans = 1;
  for (int i = 0; i<n; ++i) {
    if (coins[i] > min_ans) {
      std::cout << min_ans << "\n";
      return 0;
    } else {
      min_ans+= coins[i];
    }
  }

  std::cout << min_ans << "\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