zoukankan      html  css  js  c++  java
  • Stripies(POJ 1862 贪心)

    Stripies
    Time Limit: 1000MS   Memory Limit: 30000K
    Total Submissions: 14151   Accepted: 6628

    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

    很不显然的显然,先尽量从大的取。
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <algorithm>
     5 #include <queue>
     6 #include <cmath>
     7 using namespace std;
     8 int main()
     9 {
    10     int n,i,j;
    11     double w,a,b,sum;
    12     priority_queue<double> s;
    13     freopen("in.txt","r",stdin);
    14     while(scanf("%d",&n)!=EOF)
    15     {
    16         for(i=0;i<n;i++)
    17         {
    18             scanf("%lf",&w);
    19             s.push(w);
    20         }
    21         while(1)
    22         {
    23             a=s.top();
    24             s.pop();
    25             if(s.empty())
    26                 break;
    27             b=s.top();
    28             s.pop();
    29             s.push(2*sqrt(a*b));
    30         }
    31         printf("%0.3lf
    ",a);
    32     }
    33 }
  • 相关阅读:
    UiPath鼠标操作文本的介绍和使用
    UiPath鼠标操作元素的介绍和使用
    UiPath循环活动Do While的介绍和使用
    UiPath循环活动Do While的介绍和使用
    UiPath循环活动While的介绍和使用
    设计模式之: Decorator(装饰器)模式
    C语言深度解剖读书笔记(1.关键字的秘密)
    HDU 4341 Gold miner (分组背包)
    HDU 3496 Watch The Movie( 二维费用背包)
    Mahout源码MeanShiftCanopyDriver分析之一初识
  • 原文地址:https://www.cnblogs.com/a1225234/p/5167529.html
Copyright © 2011-2022 走看看