ABCE 求调

#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
#define int long long
const int N=1e5+10,P=998244353;
int a[N];
struct Node{
	int a[55],sum;
	bool operator < (const Node l) const
	{
		return sum<l.sum;
	}
};
priority_queue<Node>q;
bool cmp(int x,int y){
	return x>y;
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	int n,m,k;
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++) cin>>a[i];
	sort(a+1,a+n+1,cmp);
	Node st;
	st.a[1]=m,st.sum=a[1]*m;
	q.push(st);
	while(q.size()){
		Node u=q.top();
		q.pop();
		cout<<u.sum<<endl;
		k--;
		if(k==0) break;
		if(u.a[1]==0) continue;
		for(int i=2;i<=n;i++){
			Node v=u;
			v.a[i]++,v.a[1]--;
			v.sum+=a[i]-a[1];
			q.push(v);
		}
	}
	return 0;
}