1125. Chain the Ropes (25)
来源:互联网 发布:超星数据库简介 编辑:程序博客网 时间:2024/06/03 18:29
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
思路:很明显想要最长的,得要让小的先进入合并,大的放最后,所以开始时我选择了qsort(),然而测试点挂了一片……
冥思苦想下发现,并入的节点可能比排序后数组最小的那一个要大,但是显然不能每次都排序(其实因为有序,用二分查找也是可以的)
这时候当然选择我们的排序利器,set啦!
因为有重复的数值,所以声明用multiset
同样因为有重复的数值,erase(a),这种是不可取的,它会把一次把所有相同的元素都删除
set begin(),返回的是迭代器,所以用 * 返回迭代器所指的元素
代码:
#include<iostream>#include<algorithm>#include<set>using namespace std;int main(){int n, tmp;cin >> n;multiset<int> num;for (int i = 0; i < n; i++){cin >> tmp;num.insert(tmp);}while (num.size() >= 2){int a = *num.begin(); num.erase(num.begin());int b = *num.begin(); num.erase(num.begin());num.insert((a + b) / 2);}cout << *num.begin() << endl;}
- 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)[数学逻辑题]
- prvAddCurrentTaskToDelayedList
- 认识Kafka
- 为什么程序员发现不了自己的BUG?
- 你的专业 VS 你妈口中你的专业
- CDN 服务器
- 1125. Chain the Ropes (25)
- Retrofit网络请求参数注解,@Path、@Query、@QueryMap...
- UGUI制作人物展示功能
- 最通俗的SET、LIST和MAP
- 浏览器跳转
- Codeforces Round #449 (Div. 2) 总结(12.2)
- python基础-死锁、递归锁
- Android 浮雕遮罩滤镜(EmbossMaskFilter)
- 使用win10自带虚拟光驱打开ISO镜像文件