当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5619：Jam's store

题目描述
Jam didn't study well,then he go to repair the computer in a store,there are $M$ staffs and $N$ guests, given each guests have to spend $T_{ij}$ time to repair the computer by the $j$ staffs.

Now ask the total of time the guest at least to wait.
The staff wiil do the next work after he has done the current work
输入解释
The first line is $T(1 \leq T \leq 100)$ means $T$ Case

For each case

The first line is $M$ and $N(1 \leq M,N \leq 20)$ means the number of staffs and guests

Now given a Matrix with $N*M$ each number means the $i$ guests to the $j$ staff time $(1 \leq T_{ij} \leq 1000)$
输出解释
Output one line about the time at least they need to wait
输入样例 
1
4 3
4 4 1 5
8 2 5 6
4 5 10 5
输出样例 
7
提示
the first guest choose the third staff
the second guest choose the second staff
the third gurst choose the third staff
the total of time is 4+2+1=7
来自杭电HDUOJ的附加信息
Recommend hujie
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 BestCoder Round #70
源链接： HDU-5619
最后修改于 2020-10-25T23:24:15+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)