C++ 解法, 执行用时: 153ms, 内存消耗: 2260K, 提交时间: 2021-11-13 10:46:16

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int i,j,k,t,n,m;
ll hp,x,y,a[200500],sum,sb,res,tmp;

priority_queue<ll> q;

int main(){
	cin.tie(0);
	cin>>t;
	while(t--){
		cin>>hp>>x>>y>>n;
		for(i=1;i<=n;i++)cin>>a[i];
		hp=(hp+x-1)/x;tmp=hp;
		if(2ll*n<hp){cout<<"-1\n";continue;}
		while(!q.empty())q.pop();
		sb=sum=0;res=1e18;
		for(i=1;i<=n;i++){
			if(q.size()*2+2>=hp){
				res=min(res,1+sum+sb+(hp-(ll)q.size()-1)*y);
			}
			sum+=a[i]/2;
			sb+=(a[i]-a[i]/2);
			q.push(a[i]-a[i]/2);
			while((ll)q.size()*2>=hp&&q.top()>y||q.size()>=hp){
				sb-=q.top();q.pop();
			}
		}
		cout<<res<<'\n';
	}
}