POJ 1862 Stripies【哈夫曼/贪心/优先队列】

时间：2017-11-28 23:16:19 阅读：318 评论：0 收藏：0 [点我收藏+]

标签：priority intern hat use ike def amp 优先队列 contains

Stripies

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 18198		Accepted: 8175

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

Sample Output

120.000

Source

Northeastern Europe 2001, Northern Subregion

【代码】：

#include<iostream>
#include<stdio.h>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;

#define LL long long
using namespace std;
const int N = 20000+100;
int n;
double L;
double a,b;
priority_queue<double> q;
int main()
{
    cin>>n;

        for(int i=0;i<n;i++)
        {
            cin>>L;
            q.push(L);
        }
        while(q.size()>1)
        {
            a=q.top();q.pop();

            b=q.top();q.pop();

            q.push(2*sqrt(a*b));
        }
    printf("%.3f\n",q.top());

    return 0;
}

View Code

POJ 1862 Stripies【哈夫曼/贪心/优先队列】

标签：priority intern hat use ike def amp 优先队列 contains

原文地址：http://www.cnblogs.com/Roni-i/p/7912555.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行