I have given matrix with size $n$ by $m$,such that $n<100, m<15$, for example here is matrix with size $n=3, m=2$
$\begin{pmatrix}3&0\\ 6&9\\ 5&9 \end{pmatrix}$
Now for this matrix we want to find the minimum sum such that we should pick exactly one element from each column and we should pick elements that are in same row.
For example we can pick 3+9, or 6+0, 5+0, but we cannot pick 3+0 or 6+9. I was searching over the net and found out for Hungarian algorithm, but it works if we should take one element from each row and column, and here we have 100 rows and we should take only 15 of them in worst case.
Which algorithm should i use, any hints?