题目
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.
:::hljs-center
:::
Your job is to make the longest possible rope out of N N 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 ≤ 1 0 4 ) N(2\le N\le10^4) 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 1 0 4 10^4 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
题目大意
有N段绳子,每次可以连接两根,但连接后的绳子要对折(即长度减半,取整数),问将这N段绳子连接成一段绳子,这段绳子的最长长度是多少。
思路
显然优先选择最短的绳子,这样损耗最小,也就是说每次连接绳子都要从所有绳子中选择最小的两段,题目范围有 1 0 4 10^4 104,显然会超时,我们可以发现这样一个特点,每次连接两根最短的绳子,得到的绳子依然是剩下绳子中最短的那根,这也就是题目问什么要将绳子对折的原因了,OK,上代码;
代码
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(){
int n;
vector<int> d;
scanf("%d", &n);
d.resize(n);
for(int i=0; i<n; i++)
scanf("%d", &d[i]);
sort(d.begin(), d.end());
int ans = d[0];
for(int i=1; i<n; i++)
ans = (ans+d[i])/2;
printf("%d\n", ans);
return 0;
}