题目:传送门
题意:给一个n个元素的数组a,以及初始拥有值k,还有一个可增益A,另一个数组b,第i个表示在第i个增益A所需的成本,求使得数组a中所有元素均小于等于k的最小成本。
解题:按顺序遍历,用一个优先队列存放前i个价格,当当前的k小于a[i] 时,出队累加和,直到k大于等于a[i],若所有都出完仍不能满足,则令ans= -1。
代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define deg(x) cout<< #x"=" << (x) << endl;
#define degg(x,y) cout<< #x"="<< (x) <<","<< #y"="<< (y) <<endl;
#define deggg(x,y,z) cout<<#x"="<<(x)<<","<<#y"="<<(y)<<","<<#z"="<<(z)<<endl;
#define sca(x) scanf("%d",&x)
#define scaa(x,y) scanf("%d%d",&x,&y)
#define scaaa(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define pch(x) putchar(x)
#define ptf(x) printf("%d\n",x)
#define ptff(x,y) printf("%d %d\n",x,y)
#define ptfff(x,y,z) printf("%d %d %d\n",x,y,z)
#define space(x) printf("%d ",x)
#define mes(a,x) memset(a,x,sizeof(a))
#define PI acos(-1)
#define lowbit(x) x&-x
#define ALL(X) (X).begin(), (X).end()
#define PB push_back
#define MP make_pair
#define ls rt<<1
#define rs rt<<1|1
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef priority_queue<int,vector<int>,greater<int> > xqueue;
typedef priority_queue<int> dqueue;
const ll mod=1e9+7;
const ll INF=9e18;
const int inf=2147483647;
const int N=1e5+5;
int a[N],b[N];
xqueue xq;
void work() {
IOS;
int n;
ll k,A;
cin>>n>>k;
int mx=1;
for(int i=1; i<=n; i++) {
cin>>a[i];
if(a[i]>a[mx]) {
mx=i;
}
}
cin>>A;
for(int i=1; i<=n; i++) {
cin>>b[i];
}
ll ans=0;
for(int i=1;i<=mx;i++) {
xq.push(b[i]);
if(a[i]>k) {
while(a[i]>k&&xq.size()) {
ans+=xq.top();//deg(xq.top())
xq.pop();
k+=A;
}
if(a[i]>k) { ans=-1; break; }
}
}
cout<<ans<<endl;
}
int main() {
work();
return 0;
}