Submission

[PPPPPPPP][PPPPPPPP][PPPPPPPPP]

Score: 100

User: detectives_conan

Problemset: 06.Happiness

Language: cpp

Time: 0.021 second

Submitted On: 2025-04-01 11:46:55

/*
    Author : detective conan
    Problem : Happiness
    Created : 01/04/2025 10:55 UTC+7
*/
#include <bits/stdc++.h>
#define int long long
#define FOR(i, s, t) for(int i = s; i <= t; ++i)
#define rep(i, s, t) for(int i = s; i >= t; --i)
#define HAVE_TESTCASE false
#define vec vector
#define pil pair<int, i64>
#define pli pair<i64, int>
#define pii pair<int, int>
#define pll pair<i64, i64>
#define tiil tuple<int, int, i64>
#define tlii tuple<i64, int, int>
#define all(a) a.begin(), a.end()
#define great(a) a, vec<a>, greater<a>
#define lbv(a, m) lower_bound(all(a), m) - a.begin()
#define ubv(a, m) upper_bound(all(a), m) - a.begin()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define eb emplace_back
#define F first
#define S second
#define conan cin.tie(nullptr)->sync_with_stdio(false)
#define ANS(n, s) cout << n << s

using namespace std;
using u8 = uint8_t;
using u32 = unsigned;
using i64 = int64_t;
using u64 = uint64_t;

const int MAX_N = 2e5 + 10;
int n, a, sum;
priority_queue<great(int)> pq;

void solve(){
    cin >> n;
    FOR(i, 1, n){
        cin >> a;
        if(a >= 0) sum += a, pq.push(a);
        else{
            if(sum + a >= 0) sum += a, pq.push(a);
            else{
                if(!pq.empty() && a > pq.top()){
                    sum -= pq.top();
                    pq.pop();
                    sum += a;
                    pq.push(a);
                }
            }
        }
    }
    cout << pq.size() << '\n';
}

int32_t main(){
    conan;
    int t = 1;
    if(HAVE_TESTCASE) cin >> t;
    while(t--) solve();
}