1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main()
{
	int count;

	cin >> count;

	vector<int> coins(count);

	for (auto& coin : coins)
		cin >> coin;

	sort(coins.begin(), coins.end());

	long sum = 0;
	long last = 0;

	for (const auto& coin : coins)
	{
		if (coin != last)
			sum >>= coin - last;

		++sum;

		last = coin;
	}

	for (; sum > 1; sum >>= 1)
		last++;

	cout << last;

    return 0;
}