luoguP8755 [蓝桥杯 2021 省 AB2] 负载均衡

堆

include <bits/stdc++.h>

define pii pair<int,int>

using namespace std;
const int N=1e6+114;
long long n,m;
priority_queue<pii,vector,greater >q[N];
long long v[N];
int main(){
scanf ("%lld %lld",&n,&m);
for (int i=1;i<=n;i++) scanf ("%lld",&v[i]);

for (int i=1;i<=m;i++){
int a,b,c,d;
cin>>a>>b>>c>>d;
while (!q[b].empty()&&q[b].top().first<a){
v[b]+=q[b].top().second;
q[b].pop();
}
if (v[b]<d) puts("-1");
else {
q[b].push({a+c-1,d});
v[b]-=d;
printf ("%lld\n",v[b]);
}
}
return 0;
}