B. Pasha and Tea( Codeforces Round #311 (Div. 2) )
2015-08-17 18:00
357 查看
B. Pasha and Tea
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Sample test(s)
input
output
input
output
input
output
Note
Pasha also has candies that he is going to give to girls but that is another task...
点击打开链接
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Sample test(s)
input
2 4 1 1 1 1
output
3
input
3 18 4 4 4 2 2 2
output
18
input
1 5 2 3
output
4.5
Note
Pasha also has candies that he is going to give to girls but that is another task...
点击打开链接
#include<iostream> #include<algorithm> #include<stdio.h> #include<string.h> #include<stdlib.h> using namespace std; int a[200051]; int n,m; int sum; int main() { while(scanf("%d%d",&n,&m)!=EOF) { for(int i=0;i<2*n;i++) { scanf("%d",&a[i]); } sum = 0; sort(a,a+2*n); double x1 = (double)a[0]; double x2 = (double)a /2; double x3 = (double)m/(3*n); x1 = min(x1,x2); x1 = min(x1,x3); printf("%lf\n",x1*3*n); } return 0; }
相关文章推荐
- poj 2074 Line of Sight
- 安装PHP
- 查找linux设备的uuid
- [转]curl_multi 实现准多进程发请求
- Android ActivityManager与WindowManager
- 查找linux设备的uuid
- 使用query参数过滤组合AWS CLI输出信息
- C++BuilderX8e Mysql存过程储过程的增、删、改
- js实现Select头像选择实时预览代码
- Android之断点续传(二)
- 继承映射关系 subclass的查询
- css3--断行问题+多余的字用省略号代替
- SparkStreaming找不到reduceByKey的解决方法
- python3.4多线程实现同步的四种方式
- hdoj 1260 Tickets【dp】
- wpf中,隐藏或去除window右上角的关闭按钮
- 生涯咨询中的点点感触
- Codeforces 138C(区间更新+离散化)
- QTP显示TestFlow
- HttpSessionListener进行同名用户剔除登录的方法