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
#include<stdio.h>
#include<stdlib.h>

int n;
int m[202000];
int max_input;
int resault;
int k;

int main() {
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i ++) {
		scanf("%d", &k);
		m[k] ++;
		if (k > max_input)
			max_input = k;
	}
	n = 0;
	while(true) {
		if (n == max_input && m[max_input] > 1) {
			max_input++;
			resault = max_input;
		}
		m[n+1] += m[n]/2;
		n++;
		if (n > max_input)
			break;
	}

	printf("%d\n", resault);
	return 0;
}