CSU-ACM2017暑假集训比赛7 C
来源:互联网 发布:开通淘宝店铺要钱吗 编辑:程序博客网 时间:2024/05/18 05:16
C - Pasha and Tea
Pasha decided to invite his friends to a tea party. For that occasion, he has a large teapot with the capacity of w milliliters and 2n tea cups, each cup is for one of Pasha's friends. The i-th cup can hold at most ai milliliters of water.It turned out that among Pasha's friends there are exactly n boys and exactly n girls and all of them are going to come to the tea party. To please everyone, Pasha decided to pour the water for the tea as follows: Pasha can boil the teapot exactly once by pouring there at most w milliliters of water; Pasha pours the same amount of water to each girl; Pasha pours the same amount of water to each boy; if each girl gets x milliliters of water, then each boy gets 2x milliliters of water.In the other words, each boy should get two times more water than each girl does.Pasha is very kind and polite, so he wants to maximize the total amount of the water that he pours to his friends. Your task is to help him and determine the optimum distribution of cups between Pasha's friends.
Input
The first line of the input contains two integers, n and w (1 ≤ n ≤ 105, 1 ≤ w ≤ 109) — the number of Pasha's friends that are boys (equal to the number of Pasha's friends that are girls) and the capacity of Pasha's teapot in milliliters.The second line of the input contains the sequence of integers ai (1 ≤ ai ≤ 109, 1 ≤ i ≤ 2n) — the capacities of Pasha's tea cups in milliliters.
Output
Print a single real number — the maximum total amount of water in milliliters that Pasha can pour to his friends without violating the given conditions. Your answer will be considered correct if its absolute or relative error doesn't exceed 10 - 6.
Example
Input
2 41 1 1 1Output3Input3 184 4 4 2 2 2Output18Input1 52 3Output4.5
Note
Pasha also has candies that he is going to give to girls but that is another task...
简单贪心,排序后看第一个杯子和第(n+1)个杯子哪个装得较少,取这个体积按相关标准给每个人分茶,若总体积小于茶壶容积,则输出这个总体积;若总体积超出茶壶容积,则输出茶壶容积。
#include <iostream>#include <cstdio>#include <algorithm>#include <vector>#include <cstring>#include <queue>using namespace std;const int maxn = 2e5+19;int N, W;int a[maxn];int main(){#ifdef TESTfreopen("test.txt", "r", stdin);#endif // TEST while(cin >> N >> W){ double minV; for(int i = 1; i <= 2*N; i++){ scanf("%d", &a[i]); } sort(a+1, a+2*N+1); minV = min((double)a[1], (double)a[N+1]/2.0); printf("%.8f\n", min(3*minV*N, (double)W)); } return 0;}
阅读全文
0 0
- CSU-ACM2017暑假集训比赛7 C
- CSU-ACM2017暑假集训比赛1 C
- CSU-ACM2017暑假集训比赛1 C
- CSU-ACM2017暑假集训比赛1 C
- CSU-ACM2017暑假集训比赛2 C
- CSU-ACM2017暑假集训比赛7 A
- CSU-ACM2017暑假集训比赛7 B
- CSU-ACM2017暑假集训比赛7
- CSU-ACM2017暑假集训比赛7
- CSU-ACM2017暑假集训比赛7
- CSU-ACM2017暑假集训比赛1 B
- CSU-ACM2017暑假集训比赛1 A
- CSU-ACM2017暑假集训比赛2 D
- CSU-ACM2017暑假集训比赛2 B
- CSU-ACM2017暑假集训比赛2 A
- CSU-ACM2017暑假集训比赛2 E
- CSU-ACM2017暑假集训比赛2 HDU
- CSU-ACM2017暑假集训比赛2 CodeForces
- 栈的C++实现
- 大数据书籍推荐
- NYOJ 1249 物资调度(DFS+剪枝)
- 算法复杂度
- hdu 1907 John(Nim博弈)
- CSU-ACM2017暑假集训比赛7 C
- jquery事件绑定和事件委托
- 集训8.23
- python实现带l1正则化的逻辑回归,采用sgd。
- mysql给表添加注释
- java 读取Excel文件
- kotlin协程简单封装
- javase面向对象三大特性之封装
- (转载)无论你再怎么努力,和科班出身的程序员你还是差了四年的距离