3 人解决，4 人已尝试。
3 份提交通过，共有 6 份提交。
7.8 EMB 奖励。
单点时限: 3.0 sec
内存限制: 256 MB
You and your team are participating in a programming contest. After reading all problems,
you have estimated for each problem how long it will take you to solve it. Your teammates
have done exactly the same. Now you want to divide the problems, so that the total
number of solved problems will be maximized.
Your team is very organized and each team member always writes down all the details on
paper. Therefore the computer never forms a bottleneck. The only constraint is that for
each team member, the total time required to solve the problems assigned to him should
not exceed the time left in the contest.
On the first line an integer t (1 <= t <= 100): the number of test cases. Then for each test
case:
problems and the number of minutes left in the contest.
team member. The jth integer on the ith line is denoted by sij : either the time in
minutes it takes the ith person to solve the jth problem (1 <= sij <= 300), or -1 if the
person cannot solve this problem.
For each test case:
1 10 300 10 60 -1 -1 10 10 10 240 1 30 15 -1 30 -1 60 60 60 300 5 250 20 -1 -1 60 60 90 90 300 2 245
10
3 人解决，4 人已尝试。
3 份提交通过，共有 6 份提交。
7.8 EMB 奖励。