Given an array of N positive integers. You can make any number of elements in it negative such that every prefix sum of the array remains positive i.e >0. Find the maximum number of elements you can make negative.
Example 5 2 3 5 2 3
Answer= 3. This can be converted to 5 -2 3 5 -2 -3
N is 10^5 Ai<=10^9.