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
40
41
42
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	ios_base::sync_with_stdio(0);

	int n;
	cin >> n;
	vector<int> a(n);

	for (int i = 0; i < n; i++) cin >> a[i];
	sort(a.begin(), a.end());

	int b = a[0];
	int c = 1;

	for (int i = 1; i < n; i++) {
		if (a[i] == b) {
			c++;
			continue;
		}

		while (a[i] > b) {
			b++;
			c /= 2;
		}

		c++;
	}

	while (c > 1) {
		b++;
		c /= 2;
	}

	cout << b << endl;

	return 0;
}