Codefroces 735B Urbanization

                                                           B. Urbanization

Local authorities have heard a lot about combinatorial abilities of Ostap Bender so they decided to ask his help in the question of urbanization. There are n people who plan to move to the cities. The wealth of the i of them is equal to a_i. Authorities plan to build two cities, first for n₁people and second for n₂ people. Of course, each of n candidates can settle in only one of the cities. Thus, first some subset of candidates of size n₁ settle in the first city and then some subset of size n₂ is chosen among the remaining candidates and the move to the second city. All other candidates receive an official refuse and go back home.

To make the statistic of local region look better in the eyes of their bosses, local authorities decided to pick subsets of candidates in such a way that the sum of arithmetic mean of wealth of people in each of the cities is as large as possible. Arithmetic mean of wealth in one city is the sum of wealth a_i among all its residents divided by the number of them (n₁ or n₂ depending on the city). The division should be done in real numbers without any rounding.

Please, help authorities find the optimal way to pick residents for two cities.

Input

The first line of the input contains three integers n, n₁ and n₂ (1 ≤ n, n₁, n₂ ≤ 100 000, n₁ + n₂ ≤ n) — the number of candidates who want to move to the cities, the planned number of residents of the first city and the planned number of residents of the second city.

The second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 100 000), the i-th of them is equal to the wealth of the i-th candidate.

Output

Print one real value — the maximum possible sum of arithmetic means of wealth of cities' residents. You answer will be considered correct if its absolute or relative error does not exceed 10^- 6.

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if .

Examples

input

2 1 1
1 5

output

6.00000000

input

4 2 1
1 4 2 3

output

6.50000000

Note

In the first sample, one of the optimal solutions is to move candidate 1 to the first city and candidate 2 to the second.

In the second sample, the optimal solution is to pick candidates 3 and 4 for the first city, and candidate 2 for the second one. Thus we obtain(a₃ + a₄) / 2 + a₂ = (3 + 2) / 2 + 4 = 6.5

 

这道题其实还是很明确的，就是有n1个人要去城市1，n2个人去城市2，要求加起来的和为最大值，也就是比如n1个人的资金为sum1，n2个人的资金为sum2，sum=sum1/n1+sum2/n2。这道题一开始没想懂，其实我们要的就是，让大的数字尽量不要分出去，这样才能做到这个和是最大，所以我们先排序，然后保证n1小于n2，把大的数字都给n1，然后接着给n2，这样就是最大的和了。

代码如下:

#include<cstdio>
#include<algorithm>
using namespace std;

bool cmp(int a,int b)
{
	return a > b;
}

int main()
{
	int a[100005];
	int n, n1, n2, i, j, t;
	long long sum1 = 0, sum2 = 0;
	scanf("%d%d%d", &n, &n1, &n2);
	for(i = 0; i < n; i++)
		scanf("%d", &a[i]);
	sort(a, a + n, cmp);
	if(n1 > n2)
	{
		t = n1;
		n1 = n2;
		n2 = t;
	}
	for(i = 0, j = 0; j < n1; i++, j++)
	{
		sum1 += a[i];
	}
	for(j = 0; j < n2; i++, j++)
	{
		sum2 += a[i];
	}
	printf("%.8f\n", 1.0 * sum1 / n1 + 1.0 * sum2 / n2);
	return 0;
}