1125 Chain the Ropes（25 分）（cj）_1125 chain the ropes （25 分）-CSDN博客

本文链接：https://blog.csdn.net/Cute_jinx/article/details/82657008

本文介绍了一道经典的绳子连接问题，通过使用贪心算法和优先级队列（最小堆），来解决如何将多段绳子连接成尽可能长的一整段绳子的问题。输入为若干段绳子的长度，输出则是连接后的最大可能长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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:

8
10 15 12 3 4 13 1 15

Sample Output:

知识点：贪心算法加低优先级队列。

code

#pragma warning(disable:4996)
#include <iostream>
#include <queue>
using namespace std;
bool cmp(const int& a, const int& b) {
	return a < b;
}
int main() {
	int n;
	double x;
	cin >> n;
	priority_queue<double,vector<double>,greater<double>> py_q;
	for (int i = 0; i < n; ++i) {
		cin >> x;
		py_q.push(x);
	}
	while (py_q.size()>1) {
		double a = py_q.top();
		py_q.pop();
		double b = py_q.top();
		py_q.pop();
		py_q.push((a + b) / 2);
	}
	cout << int(py_q.top()) << endl;
	system("pause");
	return 0;
}