CodeForces - 557B Pasha and Tea (模拟)
2016-04-21 21:46
501 查看
CodeForces - 557B Pasha and Tea
Description 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 Input 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 Hint Pasha also has candies that he is going to give to girls but that is another task... Source Codeforces Round #311 (Div. 2) //题意:输入n,w; 表示你有n个女同学,n个男同学,一个茶壶的容量为w,有n个茶杯,它们的容量已经给出,现在要给他们倒茶,倒茶有以下要求: 1、男生茶水是女生的二倍; 2、要求倒的茶水尽量多; 问最多到多少茶水? #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; const int MAXN = 2e5 + 100; double a[MAXN]; int main() { int n; double w; while(scanf("%d%lf",&n,&w)!=EOF) { for(int i=0;i<2*n;i++) { scanf("%lf",a + i); } sort(a, a + 2 * n); if(a[0] * 2 <= a ){ if(w >= a[0]*3*n){ printf("%lf\n", a[0] * 3 * n); } else{ printf("%lf\n", w); } } else{ double v = a / 2; if(w >= v * 3 * n){ printf("%lf\n", v * 3 * n); } else{ printf("%lf\n", w); } } } return 0; } |
相关文章推荐
- HDMI基本知识
- PCANet的C++代码——详细注释版
- http和https的区别
- Java split()方法使用注意问题
- ACE_Message_Queue和spawn实现(生产者/消费者)(V2.00)
- Xcode 常用快捷键
- 20135220谈愈敏Linux_总结
- Stem函数绘图
- HDU1848 Fibonacci again and again(SG函数的应用)
- 第三次团队作业
- USACO-Section 4.4 Shuttle Puzzle (BFS)
- Python高级特性——学习笔记
- 选择排序
- XML 可扩展标记语言
- 面试真题——匿名内部类
- Hadoop常用的命令(三)
- android 更加复杂的小鱼游
- CANopen系列文章【1】--SYNC
- 团队项目冲刺第四天
- angular directive 总结