Выбрать соревнование | Задачи | Послать решение | Результаты проверки | Статистика по задачам | Вопросы и ответы | Результаты соревнования | Состояние сервера | Изменить данные | Управление командой | Помощь |

Техника программирования, моделирование

Олимпиадные задачи на английском языке

Олимпиадные задачи на английском языке

23/12/2015 | Задачи NEERC 2015 (E) |

*Ограничения: время – 2s/4s, память – 256MiB Ввод: easy.in или стандартный ввод Вывод: easy.out или стандартный вывод*

Послать решение Blockly Посылки Темы Где Обсудить (0)

Perhaps one of the hardest problems of any ACM ICPC contest is to create a problemset with a reasonable number of easy problems.
On Not Easy European Regional Contest
this problem is solved as follows.

There are `n` jury members (judges). They are numbered from 1 to `n`. Judge number `i`
had prepared `p_i` *easy problems* before the jury meeting. Each of these problems has a *hardness* between
0 and 49 (the higher the harder). Each judge also knows a very large (say infinite) number of *hard problems*
(their hardness is 50). Judges need to select `k` problems to be used on the contest during this meeting.

They start to propose problems in the ascending order of judges numbers. The first judge takes the first problem from his list
of remaining easy problems (or a hard problem, if he has already proposed all his easy problems)
and proposes it. The proposed problem is selected for the contest
*if its hardness is greater than or equal to the total hardness of the problems selected so far*,
otherwise it is considered too easy. Then the second judge does the same etc.; after
the `n`-th judge, the first one proposes his next problem, and so on. This procedure is stopped immediately when `k` problems
are selected.

If all judges have proposed all their easy problems, but they still have selected less than `k` problems, then
they take some hard problems to complete the problemset regardless of the total hardness.

Your task is to calculate the total hardness of the problemset created by the judges.

The first line of the input file contains the number of judges `n` (`2\ ≤\ n\ ≤\ 10`) and the number of
problems `k` (`8\ ≤\ k\ ≤\ 14`). The `i`-th of the following `n` lines contains the description of the problems prepared
by the `i`-th judge. It starts with `p_i` (`1≤\ p_i≤\ 10`) followed by `p_i` non negative integers between
0 and 49 – the hardnesses of the problems prepared by the `i`-th judge in the order they will be proposed.

Output the only integer – the total hardness of the selected problems.

Sample Input 1

3 8 5 0 3 12 1 10 4 1 1 23 20 4 1 5 17 49

Sample Output 1

94

Sample Input 2

3 10 2 1 3 1 1 2 2 5

Sample Output 2

354

In the first example, three problems with hardnesses of 0, 1, and 1 are selected first.
Then the first judge proposes the problem with hardness 3 and it is selected, too.
The problem proposed by the second judge with hardness 1 is not selected, because it is too easy.
Then the problems proposed by the third, the first, and the second judges are selected
(their hardnesses are 5, 12 and 23). The following three proposed problems with hardness of 17, 1 and 20 are not selected,
and the problemset is completed with a problem proposed by the third judge with hardness of 49. So the total hardness of the
problemset is 94.

In the second example, three problems with hardnesses of 1, 1, and 2 are selected first.
The second problem of the first judge (hardness 3) is too easy. The second judge is out of his easy problems,
so he proposes a problem with hardness 50 and it is selected. The third judge's problem with hardness 5 is not selected.
The judges decide to take 6 more hard problems to complete the problemset, which gives the total hardness of `54\ +\ 6\ \"cdot"\ 50\ =\ 354`.