input: Write a function to divide a given list of numbers into two equal parts such that the difference between the sums of the two parts is minimized. If the list cannot be divided into two equal parts, the function should return two parts with their sums as close as possible.
  def divide_in_two_equal_parts(lst):
      target = sum(lst) // 2
      part1 = []
      part2 = []
      left_sum = 0
      right_sum = 0
      
      for num in lst:
          if left_sum <= right_sum:
              left_sum += num
              part1.append(num)
          else:
              right_sum += num
              part2.append(num)
           
      return part1, part2
  assert divide_in_two_equal_parts([2, 3, 4, 5, 6, 7]) == ([2, 3, 4, 5], [6, 7])
  assert divide_in_two_equal_parts([1, 2, 3, 4, 5]) == ([1, 2, 3], [4, 5])
  assert divide_in_two_equal_parts([10, 20, 30, 40, 50]) == ([10, 20, 30], [40, 50])
  assert divide_in_two_equal_parts([1, 1, 1, 1, 1, 1]) == ([1, 1, 1], [1, 1, 1])
  assert divide_in_two_equal_parts([]) == ([], [])
output: def divide_in_two_equal_parts(lst):
      target = sum(lst) // 2
      part1 = []
      part2 = []
      left_sum = 0
      right_sum = 0
      
      for num in sorted(lst, reverse=True):
          if left_sum + num <= target:
              left_sum += num
              part1.append(num)
          else:
              right_sum += num
              part2.append(num)
      
      return part1, part2