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
#include <cstdio>

int main() {
	int n, a, max=0;
	int *ska = new int[201719];
	
	scanf("%d", &n);
	while (n--) {
		if (a>max)
			max=a;
		scanf("%d", &a);
		ska[a]++;
	}
	for (int i=0; i<max; i++) {
		ska[i+1] += ska[i]/2;
	}
	int div=1, b;
	for (int i=max; div>0 ; i++) {
		b = i;
		div = ska[i]/2;
		ska[i+1] += div;
	}
	printf("%d", b);
	delete []ska;
  return 0;
}