poj1862
来源:互联网 发布:考研五战 知乎 编辑:程序博客网 时间:2024/06/18 10:18
Stripies
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17560 Accepted: 7918
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.
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
3723050
Sample Output
120.000
思路:每次挑出两个大的进行计算才能使质量变为最小;
代码:
#include <iostream>#include <stdio.h>#include <string.h>#include <queue>#include <algorithm>#include <vector>#include <cmath>using namespace std;int main(){ int n; while(cin>>n&&n) { double a[20005]; int i; long long int sum=1; priority_queue<double >Q; for(i=0;i<n;i++) { cin>>a[i]; Q.push(a[i]); } double m,n; while(!Q.empty()) { m=Q.top(); Q.pop(); if(Q.empty())break; n=Q.top(); Q.pop(); double z=2*sqrt(m*n); Q.push(z); } printf("%.3f\n",m); } return 0;}
阅读全文
0 0
- poj1862
- poj1862
- poj1862
- (POJ1862)Stripies
- 贪心--poj1862
- poj1862 贪心
- POJ1862-Stripies
- POJ1862 Stripies
- poj1862 哈夫曼水题
- [POJ1862]Stripies
- POJ1862 水
- 1poj1862(贪心)
- poj1862(哈夫曼数)
- poj1862,优先队列
- POJ1862 Stripies 贪心
- POJ1862——Stripies
- POJ1862 Stripies 【贪心】
- [贪心]poj1862 Stripies
- python持久化模块:pickle和Cpickle
- 动态规划之最长公共子序列问题(LCS)
- ogg 有集成捕捉模式转换为普通模式
- git常用的一些小技巧
- 【剑指Offer】面试题19:二叉树的镜像
- poj1862
- Java+Selenium3框架设计准备篇9-用PageFactory实现POM
- iOS生成图片分享到微信的一种方法
- Ubuntu 14.04(16.04) 安装 Eclipse
- Jquery简单实用的WdatePicker时间插件
- 使用jquery动态修改a链接的href属性值
- PAT 1017A除以B
- XML技术学习
- Java排序算法之冒泡排序