Problem : there are n shops and each shop has n type of items. cost[i][j] is the cost of jth item type in ith shop. A person has to maximize expenditure. He can only buy 1 item from each shop and all purchased items should be of differnet types.
Input: cost[n][n] array
output: find max expenditure

Note: The selection should be such that each row and column are different .