算法题----多元Huffman编码问题

题目：

 

#include <iostream>
#include <queue>
using namespace std;

int main()
{
	int n, k;
	priority_queue<int, vector<int>, greater<int> >q1;//数字小的优先级最大
	priority_queue<int> q2;
	cin >> n >> k;
	for (int i = 0; i < n; i++)
	{
		int x;
		cin >> x;
		q1.push(x);
		q2.push(x);
	}
	long long sum1 = 0, sum2 = 0;
	while (q1.size() % (k - 1) != 1)
	{
		q1.push(0);
	}
	while (q1.size() > 1)//最小费用
	{
		long long sum = 0;
		for (int i = 0; i < k; i++)
		{
			sum += q1.top();
			q1.pop();
		}
		sum1 += sum;
		q1.push(sum);
	}
	while (q2.size() > 1)//最大费用
	{
		long long sum = 0;
		int a = q2.top();
		q2.pop();
		int b = q2.top();
		q2.pop();
		sum += (a + b);
		sum2 += sum;
		q2.push(sum);
	}
	cout << sum2 << " " << sum1 << endl;
}