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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <map>

using namespace std;

std::vector<int> counter(const std::vector<int>& values);

int main()
{
	long n = 0;
	std::cin >> n;
	int max = 0;
	vector<int> nominals(n);
	for(int i = 0; i < n; i++) {
		std::cin >> nominals[i];
	}

	std::vector<int> l = counter(nominals);
	std::cout << l[0];
	return 0;
}

std::vector<int> counter(const std::vector<int>& values)
{
	std::vector<int> result;
	std::map<int, int> tmp;

	for (auto kvp = values.begin(); kvp != values.end(); ++kvp) {	
		tmp[*kvp]++;
	}

	for (auto kvp = tmp.begin(); kvp != tmp.end(); ++kvp) {	
		int v = kvp->second / 2;
	
		if (v > 0)
		{
			kvp->second -= 2;
			int newValue = kvp->first + 1;
			tmp[newValue] += 1;

			if (kvp->second == 0)
			{
				tmp.erase(kvp);
			}
		}
	}

	int c = 0;
	for (auto kvp = tmp.begin(); kvp != tmp.end(); ++kvp) {
		if (kvp->second / 2 > 0)	
		{
			c = 1;
		}

		for (int i=0; i < kvp->second; i++) {
			result.insert(result.begin(), kvp->first);
		}
	}

	if (c == 1)
	{
		result = counter(result);
	}

	return result;
}