PAT (Advanced Level) 1125. Chain the Ropes (25) 解题报告
来源:互联网 发布:linux多线程机制 编辑:程序博客网 时间:2024/06/11 03:37
1125. Chain the Ropes (25)
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 <cstdio>#include <vector>#include <iostream>#include <algorithm>#include <cmath>#include <queue>using namespace std;int main(){ int n, ans = 0, a[10100]; scanf("%d", &n); for(int i = 0; i < n; i++) scanf("%d", &a[i]); sort(a, a + n); ans = a[0]; for(int i = 1; i < n; i++) ans = (ans + a[i]) / 2; printf("%d\n", ans); return 0;}
- PAT (Advanced Level) 1125. Chain the Ropes (25) 解题报告
- PAT (Advanced Level) 1125. Chain the Ropes (25)
- 【PAT】【Advanced Level】1125. Chain the Ropes (25)
- PAT (Advanced Level) Practise 1125 Chain the Ropes (25)
- PAT (Advanced Level) Practise 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 (25)
- PAT 甲级 1125. Chain the Ropes (25)
- PAT--1125. Chain the Ropes
- pat 甲1125. Chain the Ropes (贪心)
- PAT A1125. 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)
- 训练19-HTML 给标签增加圆角边框
- 带你熟悉SQLServer2016中的System-Versioned Temporal Table 版本由系统控制的临时表
- 杭电2056之Rectangles 杭电
- Another app is currently holding the yum lock; waiting for it to exit解决方法
- python虚拟环境virtualenv
- PAT (Advanced Level) 1125. Chain the Ropes (25) 解题报告
- 试水用markdown写博客
- js中innerText/value/innerHTML三个属性的区别
- 训练20-HTML 给图像设置圆角边框
- android 服务service
- PAT (Advanced Level) 1126. Eulerian Path (25) 解题报告
- PAT 1080-Graduate Admission (30)
- iOS推送通知的证书设置
- springmvc框架报错java.lang.IllegalArgumentException: No converter found for return value of type: class