1class Solution:2 def minimumRemoval(self, A: List[int]) -> int:3 return sum(A) - max((len(A) - i) * n for i, n in enumerate(sorted(A)))
WPM •0 •0
ACC •0 •0
TIME •0