input: Write a function to find the maximum sum of an array of non-negative integers that does not exceed a given upper limit value.
  assert findMaxSum(10, [1, 3, 5, 4, 2, 6]) == 9
  assert findMaxSum(8, [1, 3, 5, 4, 2, 6]) == 8
  assert findMaxSum(0, [1, 3, 5, 4, 2, 6]) == 0
  assert findMaxSum(20, [1, 3, 5, 4, 2, 6]) == 21
  assert findMaxSum(5, [0, 0, 0, 0]) == 0
output: def findMaxSum(limit, nums):
      nums.sort(reverse=True)
      current_sum = 0
      for num in nums:
          if current_sum + num <= limit:
              current_sum += num
          else:
              break
      return current_sum