its very unclear what ur trying to say but i get the idea

this gave me a headache

I used bisect to efficiently find the breaking point between negative and non-negative numbers in the sorted list, and then filtered the elements to count the positives and sum the negatives. Your approach is more efficient because you don't need to sort the array.

First i tried dividing by 4 to see what it would give me, then i realized that i could round up if i divided by 3.