Problem of the day
Input:
'N' = 3
‘COST’ = [[1 2 3],
[6 5 6],
[3 8 9]]
Output: 11
A possible assignment is:
Assign task 1 to ninja 3, task 2 to ninja 1 and task 3 to ninja 2, total cost = 3 + 2 + 6 = 11
The first line will contain the integer 'T', the number of test cases. For each test case
The first line of each test case an integer ‘N’ denoting the number of Ninjas and tasks.
The next ‘N’ lines contain ‘N’ integers denoting the cost of ith Ninja completing the jth task.
For each test case, print a single integer denoting the minimum cost of the assignment.
You don't need to print anything. It has already been taken care of. Just implement the given function.
1 <= 'T' <= 10
1 <= 'N' <= 18
1 <= 'COST[i][j]' <= 10^5
Time Limit: 1 sec
2
2
10 13
12 14
3
1 1 1
2 2 1
1 2 1
24
3
For the first test case, a possible assignment can be:
Ninja 1 to task 1, Ninja 2 to task 2.
For the second test case, a possible assignment can be:
Ninja 1 to task 2, Ninja 2 to task 3, and Ninja 3 to task 1.
2
3
2 4 6
8 4 2
8 4 8
5
1 3 5 7 4
3 4 9 10 11
1 2 1 2 1
5 4 8 3 3
6 6 6 6 6
8
15