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

using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	
	long long a;
	cin >> a;
	double d=0,c,b[a];
	for (int i=0;i<a;i++)
	{
		cin >> b[i];
	}
	sort(b, b+a);
	for (int i=a-1;i>=0;i--)
	{
		if (i==a-1)
		{
			c=b[i];
		}
		
		else
		{
			if (b[i]==c) c++;
			else if (b[i]<c)
			{
				d+=b[i]/((c-b[i])*2*b[i]);
			}
			
			if (d>=1)
			{
				c++;
				d-=1;
				d=d/((c-b[i])*2);
			}
		}
	}
	a=c;
	cout << a;

}