input: Write a function to find the maximum sum of an array of non-negative integers, given an upper limit value. If the given array is empty or all elements are greater than the limit, return 0.
  assert findMaxSum(10, [1, 3, 5, 4, 2, 6])==9
  assert findMaxSum(5, [1, 3, 5, 4, 2, 6])==5
  assert findMaxSum(20, [1, 3, 5, 4, 2, 6])==21
  assert findMaxSum(0, [1, 3, 5, 4, 2, 6])==0
  assert findMaxSum(10, [])==0
output: def findMaxSum(limit, arr):
      if not arr or max(arr) > limit:
          return 0
      arr.sort(reverse=True)
      current_sum = 0
      for num in arr:
          if current_sum + num > limit:
              continue
          current_sum += num
      return current_sum