E - Potions (Hard Version)

最新推荐文章于 2022-12-20 14:24:23 发布

xlzhk77

最新推荐文章于 2022-12-20 14:24:23 发布

阅读量269

点赞数

文章标签：算法 c++ 贪心算法

本文链接：https://blog.csdn.net/archor777/article/details/120001137

版权

这是一道关于算法的题目，求解在一条线上有正负效果的药水，如何选择饮用使得健康值始终保持非负的最大药水数量。采用反悔贪心策略，优先考虑加血药水，负值药水也先喝，并存入优先队列。当健康值小于0时，从队列中取出最减生命的药水。最终得出的最大药水饮用数为答案。

摘要由CSDN通过智能技术生成

Day1—E

This is the hard version of the problem. The only difference is that in this version n≤200000n≤200000. You can make hacks only if both versions of the problem are solved.

There are nn potions in a line, with potion 11 on the far left and potion nn on the far right. Each potion will increase your health by aiai when drunk. aiai can be negative, meaning that potion will decrease will health.

You start with 00 health and you will walk from left to right, from first potion to the last one. At each potion, you may choose to drink it or ignore it. You must ensure that your health is always non-negative.

What is the largest number of potions you can drink?

Input

The first line contains a single integer nn (1≤n≤2000001≤n≤200000) — the number of potions.

The next line contains nn integers a1a1, a2a2, ... ,anan (−109≤ai≤109−109≤ai≤109) which represent the change in health after drinking that potion.

Output

Output a