(贪心和优先队列) POJ1862 Stripies

Stripies

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 21506		Accepted: 9478

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

贪心和优先队列，先选择最大的两个数合并，然后加入队列，可以用priority_queue()，默认为最大堆。
C++代码（只能用C++编辑器过，G++却会WA）

#include<iostream>
#include<queue>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
    priority_queue<double> pq;
    int N;
    scanf("%d",&N);
    double m;
    int t = N;
    while(t--){
        scanf("%lf",&m);
        pq.push(m);
    }
    int k = N - ;
    double a,b;
    while(k--){
        a = pq.top();
        pq.pop();
        b = pq.top();
        pq.pop();
        pq.push( * sqrt(a*b));
    }
    printf("%.3lf\n",pq.top());
    pq.pop();
    return ;
}

#include<iostream>
#include<queue>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
int main(){
    priority_queue<double> pq;
    int N;
    scanf("%d",&N);
    double m;
    int t = N;
    while(t--){
        scanf("%lf",&m);
        pq.push(m);
    }
    double a,b,tmp;
    while(!pq.empty()){
        a = pq.top();
        pq.pop();
        if(pq.empty()){
            printf("%.3lf\n",a);
            break;        //要加break
        }
        b = pq.top();
        pq.pop();
        tmp =  * sqrt(a*b);
        pq.push(tmp);
    }
    return ;
}