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
#include <iostream>
#include <algorithm>

using namespace std;

int ile[201720];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;

	int maxi = 0;
	for (int i = 0; i < n; ++i)
	{
		int a;
		cin >> a;
		maxi = max(maxi, a);
		++ile[a];
	}

	for (int i = 0; i < maxi; ++i)
	{
		ile[i + 1] += ile[i] / 2;
	}

	int maxPot = maxi;
	while (ile[maxi] > 1)
	{
		++maxPot;
		ile[maxi] /= 2;
	}
	cout << maxPot;
	return 0;
}