1912A - Accumulator Apex - CodeForces Solution

#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007 //1e9+7
#define MOD2 998244353
#define MX 1000000000 //1e9
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define inte long long
#define ld long doublelu
int main()
{
//      1 1
//      3 -1 -2 -3
startt
ll x,k;
cin>>x>>k;
vector<pair<ll,ll>> b;


while(k--){
int y;
cin>>y;
int d=1;
ll j=0,m=0;
    vector<ll> v;
   // cout<<"yes"<<" ";
for(int i=0;i<y;i++){
    ll a;
    cin>>a;

    if(a>=0 and d)x+=a;
    else{
        d=0;
        j+=a;
        v.pb(j);
        // cout<<j<<" ";
    }
}



int n=v.size();
if(n>1){

vector<pair<ll,ll>> c;


 for(int i=0;i<n;i++){
    m=min(m,v[i]);
     
     if(v[i]>0){
        c.pb({m,v[i]});
        // cout<<m<<" "<<v[i]<<" ";
     }
     
 }

   n=c.size();
if(n>0){

 sort(c.rbegin(), c.rend());
 b.pb({c[0].first,c[0].second});
 ll st=c[0].second;
 for(int i=0;i<n;i++){
    if(c[i].second>st){
        b.pb({c[i].first,c[i].second-st});
        st=c[i].second;
        // cout<<c[i].first<<" "<<c[i].second<<" ";
    }
 }
}
}
 

 

}

 sort(b.rbegin(), b.rend());
 for(auto it: b){
    if(abs(it.first)<=x){
        x+=it.second;
    }
    else break;
 }
cout<<x<<endl;
return 0;
}