EASY C++ SOLUTION FOR BEGINNERS BY BEGINNER.....
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int maxScore(vector<int>& n) {
        
       

        sort(n.begin(),n.end(),greater<int>());
         vector<long long>prefix(n.size());
        prefix[0]=n[0];
        for(int i=1;i<n.size();i++)
        {
           
            prefix[i]=prefix[i-1]+n[i];
        }
        int ans=0;
        for(int i=0;i<n.size();i++)
        {
            if(prefix[i]>0)ans++;
        }
        return ans;
    }
};
```
['C++']