OIG XVII - lab

// https://szkopul.edu.pl/problemset/problem/LLE-t5aDakNd_hVE30I2-6QW/site/?key=statement
// OIJ XVII 2 etap

#include <bits/stdc++.h>

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

    int n;
    std::cin >> n;

    long long sum = 0;
    std::priority_queue<int> q;

    int ans = 0;

    for (int i = 0; i < n; i++) {
        int a;
        std::cin >> a;

        if (a < 0) {
            q.push(-a);
        }

        sum += a;

        if (sum < 0) {
            int r = q.top();

            q.pop();
            sum += 2 * r;
            ans++;
        }
    }

    std::cout << ans << "\n";

    return 0;
}