1125 Chain the Ropes (25 分)

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

题目大意：
给定一组绳子，你需要把它们串成一根绳。每次串联时需要把两端绳子对折。求可以串成的绳子的最大长度

算法分析：
不难发现，越早加入的的绳子对折的次数越多。所以要形成最长的绳子，要把长的绳子晚一些加入。这里我用了sort进行从小到大排序，注意只有一根绳子时直接输出。

AC代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int num;
	cin>>num;
	int n[num];
	for(int i=0;i<num;i++)
	scanf("%d",&n[i]);
	if(num==1){
		printf("%d",n[0]);
		return 0;
	}
	sort(n,n+num);
	double sum=(n[0]+n[1])/2;
	for(int i=2;i<num;i++){
		sum=(sum+n[i])/2;
	}
	printf("%d",(int)sum);
}