Domine
레이팅 미적용의견: 0
\(5^{th}\) round, February \(15^{th}\), 2014
Mirko has a chessboard with N rows and just three columns. Slavica has written an integer on each
field. Mirko has K dominoes at his disposal, their dimensions being 2x1, and has to arrange all of them
on the board without overlapping, in a way that each domino covers exactly two fields of the board. He
can rotate the dominoes as he pleases.
Help Mirko cover the largest sum of numbers possible with the dominoes!
The first line of input contains the integer N (\(1 \le N \le 1000\)), the number of rows, and K (\(1 \le K\) ≤
1000), the number of dominoes available.
Each of the following N lines contains three integers written in the i^{th} row of the board. All numbers
will be lesser than \(10^{6}\) by absolute value.
The first and only line of output must contain the maximal sum possible to cover with exactly K
dominoes.
5 3
2 1 -1
1 3 2
0 2 3
2 1 1
3 3 0162 2
0 4 1
3 5 113Clarification of the first example: It is optimal to place all dominoes horizontally and along the right
edge of the second row, right edge of the third row and along the left edge of the final row.
평가 및 의견
Domine
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Domine