Easy PYTHON3 solution || O(nlogn)
Simple use the sort function or use the 2 pointer approach to bring all the positive elements of the array in the front and pushing all the negative elementsof 
Simple use the sort function or use the 2 pointer approach to bring all the positive elements of the array in the front and pushing all the negative elementsof the array to the back.\n\n```\ndef maxScore(self, nums: List[int]) -> int:\n        \n        nums.sort(reverse =True)\n        \n        prefix = [nums[0]]\n        \n        for i in range(1,len(nums)):\n            prefix.append(prefix[-1] + nums[i])\n        \n        count  = 0\n        \n        for i in prefix:\n            if i > 0:\n                count +=1\n        \n        return count\n```\n\nediting the solution a bit and decreasing one for loop:\n```\n\t\tnums.sort(reverse =True)\n        \n\t\tprefix = [nums[0]]\n        count = 0\n        count +=1 if prefix[-1] > 0 else 0\n        \n        for i in range(1,len(nums)):\n            prefix.append(prefix[-1] + nums[i])\n            if prefix[-1] > 0:\n                count +=1\n                \n        return count\n```
['Two Pointers', 'Sorting', 'Prefix Sum', 'Python', 'Python3']