poj 1862 Stripies 数学

Stripies

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 11109		Accepted: 5314

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

题意：重量为m1的生物与重量为m2的生物合并后变为一个生物，该生物的重量为2*sqrt(m1*m2)。求给定数量的生物合并成一个生物后的最小重量。

基本不等式： a+b>=2*sqrt(a*n)> max(a,b)

一个贪心的想法，原先质量越大的，如果越先被计算，那么开根号的次数就会越多，相比之下，最终结果就会越小。

题目归属于STL库优先队列，每次选取最大的两次，合并的值丢到队伍中，在选取前俩大。但是根据公式，
2*sqrt(a*n)> max(a,b)>max(a[后面的])一次排序就OK了
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
int a[110];
bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    //freopen("in.txt","r",stdin);
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
     scanf("%d",&a[i]);
    sort(a,a+n,cmp);
    double ans=a[0];
    for(int i=1;i<n;i++)
    {
        ans=2*sqrt(ans*a[i]);
    }
    printf("%.3f\n",ans);
    return 0;
}