Simple Racket solution using functional style
Approachsort the list in descending order, take a running sum of the sorted list, and then count the number of positive numbers.Code
# Approach
sort the list in descending order, take a running sum of the sorted list, and then count the number of positive numbers.

# Code
```racket []
(define (max-score nums)
    (count positive?
        (foldl (lambda (val acc) (cons (+ (first acc) val) acc)) 
               '(0) 
               (sort nums >))))
```
['Racket']