Codeforces Round #382 (Div. 2)-735B. Urbanization（贪心）

B. Urbanization
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

题意：给出N，N1，N2代表有N个人想移民，N1个人想移民到城市1，N2个人想移民到城市2，接着给出N个人的财产。求出移民到城市1的人的财产平均值与移民到城市2的人的财产平均值的最大值。

思路：对N个人的财产降序排列，前min(N1,N2)求一次平均值，接着往后max(N1,N2)个数再求一次平均值，输出两次平均值之后即可。

代码

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<queue>
using namespace std;
const int maxn=100005;
int num[maxn];
int N,n1,n2;
bool cmp(int x,int y)
{
    return x>y;
}
int main()
{
    scanf("%d%d%d",&N,&n1,&n2);
    for(int i=0; i<N; i++)
        scanf("%d",&num[i]);
    sort(num,num+N,cmp);
    int max_num=max(n1,n2);
    int min_num=min(n1,n2);
    double max_sum=0.0;
    double min_sum=0.0;
    for(int i=0; i<min_num; i++)
        min_sum+=num[i];
    min_sum=min_sum/(min_num*1.0);
    for(int i=min_num; i<max_num+min_num; i++)
        max_sum+=num[i];
    max_sum=max_sum/(max_num*1.0);
    printf("%.8lf\n",max_sum+min_sum);
}