[POJ1806]Stripies

Description

Our chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian - polosatiki, but the scientists had to invent an English name to apply for an international patent). The stripies are transparent amorphous amebiform creatures that live in flat colonies in a jelly-like nutrient medium. Most of the time the stripies are moving. When two of them collide a new stripie appears instead of them. Long observations made by our scientists enabled them to establish that the weight of the new stripie isn’t equal to the sum of weights of two disappeared stripies that collided; nevertheless, they soon learned that when two stripies of weights m1 and m2 collide the weight of resulting stripie equals to 2*sqrt(m1*m2). Our chemical biologists are very anxious to know to what limits can decrease the total weight of a given colony of stripies.
You are to write a program that will help them to answer this question. You may assume that 3 or more stipies never collide together.

Input

The first line of the input contains one integer N (1 <= N <= 100) - the number of stripies in a colony. Each of next N lines contains one integer ranging from 1 to 10000 - the weight of the corresponding stripie.

Output

The output must contain one line with the minimal possible total weight of colony with the accuracy of three decimal digits after the point.

Sample Input

3
72
30
50

Sample Output

120.000

My Problem Report

将所有元素带入共公式，多次平方展开后可发现，越往后带入公式的元素幂越小。因此此题采用贪心策略求解，将所有元素押入一个优先队列，每次取出两个元素打入公式计算后，重新压入新的元素。

Trick

关于输出使用%lf和%f的问题：

Author:夏天的风
Link:http://blog.csdn.net/shahdza/article/details/6690273

---

对于printf()，无论是%f还是%lf，效果都是一样的。
因为，遇到float，printf()会将float类型自动提升到double，所以不会有什么问题。
而且严格地讲，printf()并没有对于%lf的定义，虽然很多编译器会接受，所以最好使用%f。
而对于scanf()，由于接受的是指针，并没有类型提升的说法，所以对于double就应该用%lf，float就是%f。

My Code

//  Created by Chlerry in 2015.
//  Copyright (c) 2015 Chlerry. All rights reserved.
//  http://acm.hust.edu.cn/vjudge/contest/view.action?cid=75399#problem/A

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <climits>
#include <string>
#include <vector>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define ll long long

priority_queue<double> q;
int n;
double temp;

int main()
{
    //freopen("in.txt","r",stdin);
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>temp;
        q.push(temp);
    }
    while(q.size()>1)
    {
        temp=q.top();
        q.pop();
        temp=2*sqrt(temp*q.top());
        q.pop();
        q.push(temp);
    }
    printf("%.3f\n",q.top());
    return 0;
}