Kolikot

#include <iostream>
#include <string>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <algorithm>


int main()
{
	unsigned int result = 0;
	unsigned int count;
	std::cin >> count;
	std::vector<unsigned int> numbers;
	numbers.reserve(count);
	for(unsigned int i = 0;i < count;i++)
	{
		unsigned int this_number;
		std::cin >> this_number;
		numbers.push_back(this_number);
	}
	std::sort(numbers.begin(),numbers.end());
	for(unsigned int i = 0;i < count;i++)
	{
		if(result >= numbers[i] - 1)
			result += numbers[i];
		else
			break;
	}
	std::cout << result + 1;
	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