此题理解了就很简单。对于一个重量为m1,m2的stripies,它们相遇后产生一个新的重量为2*sqrt(m1*m2)的stripies,那么我们的贪心策略就是每次挑选两个质量最大的stripies来“相遇”,因为我们可以看出来,越早挑选的stripies,它在之后所经历的开方层数越多(因为它不断遇到新的stripies,那么计算更新的stripies时,它就要经历新的开方),那么如果大的能够早点产生,它所经历的开方层数就越多,最后产生的结果也就越小啦~
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll __int64
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m;
#define M 110
#define N 1000010
#define Mod 258280327
#define p(x,y) make_pair(x,y)
const int MAX_len=550;
struct Node{
double v;
bool operator < (const Node &x) const{
return v<x.v;
}
};
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
while(sf(n)!=EOF){
priority_queue<Node> q;
Node tmp;
for(int i=0;i<n;i++){
scanf("%lf",&tmp.v);
q.push(tmp);
}
double ans;
while(!q.empty()){
if(q.size() == 1){
ans = q.top().v;
q.pop();
continue;
}
double x = q.top().v;
q.pop();
double y = q.top().v;
q.pop();
tmp.v = 2*sqrt(x*y);
q.push(tmp);
}
printf("%.3f\n",ans);
}
return 0;
}