Perfect Assignment
N workers must each take one of N distinct tasks; cost[i][j] is worker i on task j. Minimize the total cost.
Input: the first line has N; the next N lines are the cost matrix.
Output: the minimum total assignment cost.
Constraints:
- 1 ≤ N ≤ 13
- 0 ≤ cost ≤ 1000
Sample Tests
Input 1
2 1 2 3 4
Output 1
5
Input 2
1 5
Output 2
5
Discussion (opens after you solve — no spoilers before)
No comments yet.