Minimum cost assignment
You must assign n workers to n jobs, one worker per job. cost[i][j] is the cost of assigning worker i to job j. Return the minimum total cost of a complete assignment (a perfect matching). Constraints: 1 <= n <= 80, 0 <= cost[i][j] <= 10^6. A simple greedy or per-row minimum does NOT give the optimum.
Implement
min_assignment_cost(cost: list[list[int]]) → intExamples
in
[[[9,2,7],[6,4,3],[5,8,1]]]out9What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 40 min
solution.py
InputExpectedGot
[[[9,2,7],[6,4,3],[5,8,1]]]9not run yetsample