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

using namespace std;

priority_queue<int, vector<int>, greater<int>> pq;
int main() {
  int n, t;
  cin >> n;
  for (int i=0; i<n; i++) {
    cin >> t;
    pq.push(t);
  }

  while(pq.size() > 1) {
    int a, b;
    a = pq.top();
    pq.pop();
    b = pq.top(); 
    pq.pop();

    if (a == b) {
      pq.push(a+1);
    } else {
      pq.push(max(a,b));
    }
  }
  cout << pq.top();
}