Stripies
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. 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 Source Northeastern Europe 2001, Northern Subregion |
题目链接:http://poj.org/problem?id=1862
题目大意:有n个变形虫,当一个重量为m1的变形虫和一个重量为m2的变形虫相撞时,质量会变成2*sqrt(m1*m2);求最后最少的质量。
思路:有点哈夫曼树的感觉,每次选择重量最大的两个变形虫相撞即可获得最小重量,因为两个最大的相撞后减少的重量最多。
AC代码如下:
要注意G++提交%f,C++提交%lf
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
int n;
double a[105];
bool cmp(double x, double y){
return x > y;
}
int main(){
while(~scanf("%d",&n)){
for(int i = 0; i < n; i ++){
scanf("%lf",&a[i]);
}
sort(a,a+n,cmp);
for(int i = 0; i < n-1; i ++){
a[i+1] = 2*sqrt(a[i]*a[i+1]);
sort(a+i+1,a+n,cmp);
}
printf("%.3lf\n",a[n-1]);
}
return 0;
}