Kolikot

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

using std::cout;
using std::cin;
using std::endl;

int main () {
  uint32_t n;
  cin >> n;
  
  std::vector<uint32_t> k;

  for (; n>0; --n) {
    uint32_t z;
    cin >> z;
    k.push_back(z);    
  }

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

  uint32_t solution = 1;  

  for (uint32_t i = 0; i < k.size(); i++) {
    if (k.at(i) > solution) {
      break;
    } else {
      solution += k.at(i);
    }
  }

  cout << solution << endl;
  return 0;
}

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: WRONG ANSWER

Test 16

Group: 3

Verdict: ACCEPTED