Kolikot

#include <iostream>
#include <set>
#include <vector>
 
int hasnt_skipped(std::set<int> &sums) {
    int previous = *(sums.begin());
    int highest = *(sums.rbegin());
    while (previous != highest) {
        if (sums.find(previous + 1) != sums.end()) {
            previous += 1;
            continue;
        } else {
            return previous + 1;
        }
    }
    return previous + 1;
}
 
int main() {
    int n;
    std::cin >> n;
    
    std::set<int> sofar;
    std::vector<int> news;
    
    sofar.insert(0);
    
    int x;
    int min_sum = 0;
    
    for(int i = 0; i < n; ++i) {
        std::cin >> x;
        for(auto s: sofar) {
            news.push_back(x + s);
        }
        for(auto nw: news) {
            sofar.insert(nw);
        }
        news.clear();
    }
    
    min_sum = hasnt_skipped(sofar);
    std::cout << min_sum;
    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: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: RUNTIME ERROR

Test 16

Group: 3

Verdict: RUNTIME ERROR