Kolikot

#include <iostream>
#include <algorithm>
#include <vector>

int main() {
  /*
  Sort the numbers, then go over the numbers in order.
  largest tells us the largest number for which, all numbers below it can
  be produced. Trivially, since we sorted the list, no numbers larger than it
  can be represented, or largest + 1 is our answer.
  */
  int n;
  std::cin >> n;
  std::vector<long long> coins;
  for (int i = 0; i < n; ++i) {
    int v;
    std::cin >> v;
    coins.push_back(v);
  }
  std::sort(coins.begin(), coins.end());

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

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED