Given an n by n matrix `A`. Where `A[i][j]` represents the distance beween person `i` and bike `j`. \n\nWhat is the minimum total distance between each person and their bike. Note that each person can only have one bike, and each bike can only be assigned to one person. Total distance is the sum of the distance between each person and their bike. \n\nThe obvious solution is O(n!). Is there a better solution?

Given an n by n matrix A. Where A[i][j] represents the distance beween person i and bike j. \n\nWhat is the minimum total distance between each person and their