POJ 1862 Stripies （priority_queue 优先队列）

做法：

#include <iostream>
#include <cstdio>
#include <string.h>
#include <queue>
#include <cmath>
typedef long long int lli;
using namespace std;

int main(){
int t;
cin>>t;
priority_queue<double,vector<double>,less<double> > q;
int temp;
for(int i = 1;i <= t;i++){
scanf("%d",&temp);
q.push(temp);
}
while(q.size() > 1){
double a = q.top();
q.pop();
double b = q.top();
q.pop();
q.push(2*sqrt(a*b));
}
double ans = q.top();
printf("%.3f\n",ans);
}