Campus Bikes II

Given positions of n workers and n bikes, find the minimum total Manhattan distance for assigning each worker to a bike. Each worker gets exactly one bike and each bike to one worker.

Examples
Input: [[[0,0],[2,1]],[[1,2],[3,3]]]
Output: 6
Hints

Campus Bikes II

Given positions of `n` workers and `n` bikes, find the minimum total Manhattan distance for assigning each worker to a bike. Each worker gets exactly one bike and each bike to one worker.