Best Java Approach
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ --> O(n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n0(1)\n\n# Code\n```\nclass Solution {\n    public int maxScore(int[] nums) {\n        Arrays.sort(nums);\n        int n = nums.length;\n        long sum = 0;\n        int ans = 0;\n        for(int i=n-1;i>=0;i--){\n            sum+=nums[i];\n            if(sum>0){\n                ans++;\n            }\n            else{\n                break;\n            }\n        }\n        return ans;\n    }\n}\n```
['Java']