1125. Chain the Ropes (25) 贪心
来源:互联网 发布:剑灵洪门崛起进阶数据 编辑:程序博客网 时间:2024/06/07 02:37
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.
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<cstdio>#include<algorithm>#include<vector>#include<set>#include<queue>#include<cstring>#include<map>using namespace std;int main(){int n;int a[10000+10];scanf("%d",&n);for(int i=0;i<n;i++) scanf("%d",&a[i]);sort(a,a+n);int sum=a[0];for(int i=1;i<n;i++){sum=(sum+a[i])/2;}printf("%d",sum);return 0;}
- 1125. Chain the Ropes (25) 贪心
- pat 甲1125. Chain the Ropes (贪心)
- 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)
- 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) 解题报告
- Java基础——volatile关键字解析
- 常用注解
- 宏函数
- vue中的跨域代理
- 库文件
- 1125. Chain the Ropes (25) 贪心
- JAVA如何使用Dom4j解析xml的DEMO案例
- jy-大佬作业(3)
- 三个水杯 搜索
- 习题7.1
- Spark中的checkpoint作用与用法
- [HDU
- 周一,关于sql几个join的理解
- java集合类整理