【PAT刷题甲级】1125.Chain the Ropes

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≤10 ^4 ). Then N positive integer lengths of the segments are given in the next line, separated by spaces. All the integers are no more than 10 ^4 .

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

8
10 15 12 3 4 13 1 15

Sample Output

14

题意

给出一些绳子的段，每次选两段分别对折成环拼在一起成为一段，对折后绳段长度减半。要求最终绳子的长度最长。输出最终长度（向下取整）
直接将绳段递增排序，每次相加减半即可。
知识点：
floor()：向下取整
ceil()： 向上取整
round() ：四舍五入
强制转换：直接截取

代码

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
vector<double> v;
int main() {
	int n;
	scanf("%d",&n);
	double t;
	for(int i=0; i<n; i++) {
		scanf("%lf",&t);
		v.push_back(t);
	}
	sort(v.begin(),v.end());
	double sum = v[0];
	for(int i=1;i<n;i++){
		sum += v[i];
		sum /= 2;
	}
	cout << floor(sum);
	return 0;
}