Submission #55530020

---

Source Code Expand

# include <iostream>
# include <algorithm>
using namespace std;

const int MAX=2e5+11;
pair<long long, long long> a[MAX];
long long ans[MAX];
int n;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i].first>>a[i].second;

    long long mini=0, maxi=0;
    for(int i=1;i<=n;i++)
    {
        mini+=a[i].first;
        maxi+=a[i].second;
    }

    if(mini>0 or maxi<0) {cout<<"No"<<"\n";return 0;}
    cout<<"Yes"<<"\n";

    long long curr=0;
    for(int i=1;i<=n;i++)
    {
        ans[i]=a[i].second;
        curr+=a[i].second;
    }

    for(int i=1;i<=n;i++)
    {
        if(curr>0)
        {
            long long d=a[i].second-a[i].first;
            if(curr>d) {ans[i]=a[i].first;curr-=d;}
            else {ans[i]-=curr;curr=0;}
        }

        cout<<ans[i]<<" ";
    }
    cout<<"\n";

    return 0;
}

Submission Info

Judge Result