1125. Chain the Ropes (25)
来源:互联网 发布:spinner控件绑定数据 编辑:程序博客网 时间:2024/06/10 22:31
Given some segments of rope, you are supposed to chain them into one rope. Each time you may only fold two segments into loops and chain them into one piece, as shown by the figure. The resulting chain will be treated as another segment of rope and can be folded again. After each chaining, the lengths of the original two segments will be halved.
![](http://nos.patest.cn/na_ol5x4jo19qm.jpg)
Your job is to make the longest possible rope out of N given segments.
Input Specification:
Each input file contains one test case. For each case, the first line gives a positive integer N (2 <= N <= 104). Then N positive integer lengths of the segments are given in the next line, separated by spaces. All the integers are no more than 104.
Output Specification:
For each case, print in a line the length of the longest possible rope that can be made by the given segments. The result must be rounded to the nearest integer that is no greater than the maximum length.
Sample Input:810 15 12 3 4 13 1 15Sample Output:14贪心算法
#include<iostream>#include<algorithm>using namespace std;int num[10005];int main(){ int n; double sum=0; cin>>n; for (int i=0;i<n;i++) cin>>num[i]; sort(num,num+n); sum=num[0]; for (int i=1;i<n;i++) sum=1.0*(sum+num[i])/2; cout<<(int)sum; return 0;}
- 1125. Chain the Ropes (25)
- 1125. Chain the Ropes (25)
- 1125. Chain the Ropes (25)
- 1125. Chain the Ropes (25)
- 1125. Chain the Ropes (25)
- 1125. Chain the Ropes (25)
- PAT 1125. Chain the Ropes (25)-甲级
- PAT 1125. Chain the Ropes (25)
- PAT_A 1125. Chain the Ropes (25)
- PAT甲级.1125. Chain the Ropes (25)
- PAT甲级 1125. Chain the Ropes (25)
- PAT 甲级 1125. Chain the Ropes (25)
- 1125. Chain the Ropes (25) 贪心
- PAT--1125. Chain the Ropes
- 1125. Chain the Ropes 解析
- PAT (Advanced Level) 1125. Chain the Ropes (25)
- PAT (Advanced Level) 1125. Chain the Ropes (25) 解题报告
- 1125. Chain the Ropes (25)[数学逻辑题]
- C++—volatile、explicit、mutable关键字
- ActionScript 中的接口
- 使用vs2015打开以前版本的.sln工程不兼容的问题
- yii框架的增删改查加分页简单代码[yii 2.0]
- Android 友盟推送踩坑
- 1125. Chain the Ropes (25)
- 逻辑运算
- 最简回溯法求全排列-递归形式 快速领悟回溯法窍门
- JSON打印
- Multiplication Table CodeForces
- BeagleBone Black(UBUNTU)通过USB线联网
- HttpServletRequest获取提交表单参数(五)
- 支持向量机的问题转化与推导
- 二叉树中和为某一值的路径