算法暴力

(暴力枚举) $O(nlogn)$

C++ 代码

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+19;
using ll =long long;
ll a[N];
ll n,m;
struct qujian{
    ll ori;
    ll en;
}b[N];
int main()
{
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=1;i<=m;i++)cin>>b[i].ori;
    for(int i=1;i<=m;i++)
    {   
        b[i].en=0; 
        for(int j=1;j<=n;j++)
        {
            if(b[i].en==b[i].ori)break;
            if(a[j]>b[i].en&&a[j]<=b[i].ori)
            {
                ll tmp=a[j]-b[i].en;
                b[i].en+=tmp;
                a[j]+=tmp;
            }
            else if(a[j]>b[i].ori)
            {
                a[j]+=b[i].ori-b[i].en;
                break;
            }
        }
    }
    for(int i=1;i<=n;i++)cout<<a[i]<<'\n';
    return 0;
}