POJ 1862
来源:互联网 发布:瑞典 二战 知乎 编辑:程序博客网 时间:2024/06/13 02:31
Stripies
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 17895 Accepted: 8057
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
Source
Northeastern Europe 2001, Northern Subregion
有序贪心。
最大的这两碰撞以后绝对是比以前大的,也就是比下一位数大的。
所以可以排序往后扫。做复杂了。
#include<iostream>#include<math.h>#include<cstring>#include<algorithm>#include<set>#include<map>#include<queue>#include<cstdio>#include<vector>const int INF=0x7fffffff;const int maxn=110;using namespace std;double a[maxn];int n;int main(){ cin>>n; priority_queue<double ,vector<double >,less<double > > que; for(int i=0;i<n;i++) { cin>>a[i]; que.push(a[i]); } double Ans=0; while(que.size()>=2) { double x=que.top(); que.pop(); double y=que.top(); que.pop(); double ans=2*sqrt(x*y); que.push(ans); } printf("%.3f\n",que.top()); return 0;}
- poj 1862
- POJ 1862
- poj--1862
- poj 1862
- POJ 1862
- POJ 1862
- poj 1862
- 【POJ】1862
- POJ 1862
- poj 1862 priority_queue
- POJ 1862 Stripies (贪心)
- POJ 1862 Stripies
- POJ 1862 优先队列
- poj 1862 Stripies
- POJ 1862
- POJ:1862 Stripies
- poj 1862 Stripies
- POJ 1862 最小质量
- java八种基本数据类型
- Android启动流程
- 【java】冒泡法实现日期的排序
- 命令行java可以运行,javac不能运行
- spring boot入门demo
- POJ 1862
- Java开发环境配置的作用
- (网易2018校招笔试)[编程题] 游历魔法王国
- HDU 6201transaction 【树形DP】
- Jmeter FTP服务
- 全面升级Android面试之HandlerThread面试题集
- jmeter访问本地搭建的服务器报错的问题
- SSH命令与ssh免密登陆
- luoguP2709 小B的询问