CodeForces 557B-Pasha and Tea【模拟】
2016-04-21 20:07
513 查看
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.
Examples
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.
Examples
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<cstdio> #include<cmath> #include<cstring> #include<algorithm> using namespace std; typedef long long ll; const double eps=1e-8; double x[2000005]; double cal(ll n,ll w) { double tp=min(x[0],x[n/2]/2.0); double ans=tp*3*(n/2); if(ans<w*1.0) { return ans; } return w*1.0; } int main() { ll n,w; while(~scanf("%lld%lld",&n,&w)) { memset(x,0,sizeof(x)); n*=2; for(int i=0;i<n;++i) { scanf("%lf",&x[i]); } sort(x,x+n); double ans=cal(n,w); printf("%.7lf\n",ans); } return 0; }
相关文章推荐
- 教你如何使用okhttp缓存
- 地理定位(iOS7)
- Hadoop作业调度器
- python自动化测试(4)-使用第三方python库技术实现
- [转载]备忘:VC++6.0 获取其他窗口中文本框内容
- 用keil创建第一个STM32F103RC项目
- 二、测试作业
- 模板类中重载<<和>>操作符
- Codeforces 525C. Ilya and Sticks
- 剑指offer(二十)之不用加减乘除做加法
- 区块链技术安全
- linux mount命令的用法详细解析
- centos安装python
- Java中大小端的处理
- 构建之法学习心得3:源代码的合作
- iOS开发————几种音频播放方式
- git开发篇---将本地代码推送到远程
- 特殊的算术操作指令详解
- Quartz时间配置规则
- java--ArrayList去除集合中字符串的重复值