FunctionRacerProblemsRace

Cheapest Pairing

MediumSciPyPython

cost[i][j] is the cost of giving job j to worker i. Every worker gets exactly one job and every job goes to exactly one worker. Return the smallest possible total cost.

Example 1

cost [[4,1],[2,8]]
returns 3

Worker 0 takes job 1 (cost 1) and worker 1 takes job 0 (cost 2).

Constraints

Race itor take your time

Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.

More SciPy problems