EAsiest Solution ||  C++
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)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int maxScore(vector<int>& nums) {\n      sort(nums.begin(),nums.end(),greater<int>());\n        int n=nums.size();\n        vector<long long>pre(n);\n        int ans=0;\n        pre[0]=nums[0];\n        if(pre[0]>0) ans++;\n        for(int i=1;i<n;i++){\n            pre[i]=pre[i-1]+nums[i];\n            if(pre[i]>0) ans++;\n        }\n        return ans;\n    }\n};\n```
['C++']