Java | Sorting | Simple code
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: $$O(n*log(n))$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: $$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n  public int maxScore(int[] nums) {\n    var n = nums.length;\n    Arrays.sort(nums);\n    \n    var sum = 0L;\n    var i = n-1;\n    for (; i >= 0; i--) {\n      sum += nums[i];\n      if (sum <= 0) break;\n    }\n    return n-1-i;\n  }\n}\n```
['Sorting', 'Java']