#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
typedef long long LL;
int n;
LL a[200005];
priority_queue<int> q;//反悔贪心
int main()
{
scanf_s("%d", &n);
int sum = 0;
int k = 0;
for (int i = 0; i < n; i++)
{
int x;
scanf_s("%d", &x);
sum += x;
k++;
if (x < 0)
{
q.push(-x);
}
if (sum < 0)
{
int j = q.top();
sum += j;
q.pop();
k--;
}
}
printf("%d\n", k);
return 0;
}
反悔贪心-
最新推荐文章于 2024-07-25 11:18:29 发布