time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 ai. Authorities plan to build two cities, first for n1 people and second for n2 people. Of course, each of n candidates can settle in only one of the cities. Thus, first some subset of candidates of size n1 settle in the first city and then some subset of size n2 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 ai among all its residents divided by the number of them (n1 or n2 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, n1 and n2 (1 ≤ n, n1, n2 ≤ 100 000, n1 + n2 ≤ 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 a1, a2, …, an (1 ≤ ai ≤ 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 (a3 + a4) / 2 + a2 = (3 + 2) / 2 + 4 = 6.5
【题目链接】:http://codeforces.com/contest/735/problem/B
【题解】
贪心;
把分母小的放在那个分子大的财富和的上面;
剩下的分配在分母大的那个财富和上面;
即把ai排序下；
然后从大到小分配两个部分出来；
a[n-min(n1,n2)+1..n]分配给min(n1,n2);
剩下的从大到小选max(n1,n2)个给max(n1,n2);
我也不知道；反正就是贪呗.
【完整代码】
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <set>
#include <map>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <stack>
#include <string>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
void rel(LL &r)
{
r = 0;
char t = getchar();
while (!isdigit(t) && t!='-') t = getchar();
LL sign = 1;
if (t == '-')sign = -1;
while (!isdigit(t)) t = getchar();
while (isdigit(t)) r = r * 10 + t - '0', t = getchar();
r = r*sign;
}
void rei(int &r)
{
r = 0;
char t = getchar();
while (!isdigit(t)&&t!='-') t = getchar();
int sign = 1;
if (t == '-')sign = -1;
while (!isdigit(t)) t = getchar();
while (isdigit(t)) r = r * 10 + t - '0', t = getchar();
r = r*sign;
}
const int MAXN = 1e5+100;
const int dx[5] = {0,1,-1,0,0};
const int dy[5] = {0,0,0,-1,1};
const double pi = acos(-1.0);
int n,n1,n2;
int a[MAXN];
int main()
{
//freopen("F:\rush.txt","r",stdin);
rei(n);rei(n1);rei(n2);
rep1(i,1,n)
rei(a[i]);
sort(a+1,a+1+n);
double ans = 0;
int t = min(n1,n2);
rep1(i,n-t+1,n)
ans+=a[i];
ans=ans/(t*1.0);
double ans2= 0;
int t1 = max(n1,n2);
rep1(i,n-t-t1+1,n-t)
ans2+=a[i];
ans2 = ans2/(t1*1.0);
ans+=ans2;
printf("%.6lf
",ans);
return 0;
}