POJ1862 Stripies 贪心算法

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int N, num[107];
double ans = 1.0;
void input()
{
    scanf("%d", &N);
    for (int i = 1; i <= N; i++)
    {
        scanf("%d", &num[i]);
    }
    sort(num + 1, num + N + 1);
}
void solve()
{
    ans = num[N] * 1.0;
    for (int i = N - 1; i >= 1; i--)
    {
        ans = sqrt(num[i] * 1.0 * ans) * 2;
    }
}
int main()
{
    input();
    solve();
    printf("%.3f", ans);
    return 0;
}