1125 Chain the Ropes (连接绳子)
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:
8
10 15 12 3 4 13 1 15
Sample Output:
14
题目大意:每条绳子可以对折形成环跟另一条同样对折成环的绳子连接成新的一条绳子,这样产生的新绳子就是原来两条绳子长度之和的一半;形成的新绳子又继续跟其他绳子以同样的方法连接成另一条新绳;给出一个整数序列(绳子的长度),求能够连接成的最长的绳子的长度。
思路:将数列从小到大排列,尽量先对折长度较小的绳子。
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
int N,i;
int len;
scanf("%d",&N);
vector<int> v(N);
for(i=0;i<N;i++)
scanf("%d",&v[i]);
sort(v.begin(),v.end());
len=v[0];
for(i=1;i<N;i++)
len=(len+v[i])/2;
printf("%d\n",len);
return 0;
}