3801. Minimum Cost to Merge Sorted Lists

You are given a 2D integer array lists, where each lists[i] is a non-empty array of integers sorted in non-decreasing order. You may repeatedly choose two lists a = lists[i] and b = lists[j], where i != j, and merge them. The cost to merge a and b is: len(a) + len(b) + abs(median(a) - median(b)), where len and median denote the list length and median, respectively. After merging a and b, remove