Kolikot

#include <iostream>
#include <set>
#include <cstdint>

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

uint32_t subsets_matching_sum(std::multiset<uint32_t> k, uint32_t s) {
  uint32_t* arr = new uint32_t[s+1];
  arr[0] = 1;

  for (auto el : k) {
    for (int32_t num = s - el; num >= 0; --num) {
      if (arr[num]) {
        arr[num + el] += arr[num];
      }
    }
  }

  return arr[s];
}

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

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

  for (uint32_t i = 1;; ++i) {
    if (subsets_matching_sum(k, i) == 0) {
      cout << i;
      break;
    }
  } 
 
  cout << 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: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED