Timus 1161. Stripies

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 m 1 and m 2 collide the weight of resulting stripie equals to 2·sqrt(m 1m 2). 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 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 two decimal digits after the point.

Sample

input	output
3 72 30 50	120.00

奇怪的数学题：

排序，然后由大到小合并。

这里使用点新东西，使用个multiset<double>容器来解决问题，这样连排序都省了。然后是倒序处理数组。

很好用的容器。

#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
using namespace std;

void Stripies1161()
{
	multiset<double> s;
	int n = 0;
	double a;
	cin>>n;
	for (int i = 0; i < n; i++)
	{
		cin>>a;
		s.insert(a);
	}
	auto it = s.rbegin();
	a = *it;
	for (it++; it != s.rend(); it++)
	{
		a = 2.0 * sqrt(a * (*it));
	}
	cout<<a;
}