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

Жадные алгоритмы

Быстрая сортировка

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

Быстрая сортировка

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

03/07/2008 | Лето 2008 дорешивание (12C) |

28/07/2008 | Лето 2008 - 12 (C) |

24/07/2013 | Лето 2013-16 (командная) (C) |

*Ограничения: время – 1s/2s, память – 64MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод*

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

Once upon a time, in the Kingdom of Loowater,
a minor nuisance turned into a major problem.

The shores of Rellau Creek in central Loowater had always been a prime
breeding ground for geese. Due to the lack of predators, the geese
population was out of control. The people of Loowater mostly kept clear
of the geese. Occasionally, a goose would attack one of the people,
and perhaps bite off a finger or two, but in general, the people
tolerated the geese as a minor nuisance.

One day, a freak mutation occurred, and one of the geese spawned a
multi-headed fire-breathing dragon. When the dragon grew up, he threatened
to burn the Kingdom of Loowater to a crisp. Loowater had a major problem.
The king was alarmed, and
called on his knights to slay the dragon and save the kingdom.

The knights explained: "To slay the dragon, we must chop off all its
heads. Each knight can chop off one of the dragon's heads. The heads
of the dragon are of different sizes. In order to chop off a head,
a knight must be at least as tall as the diameter of the head.
The knights' union demands that for chopping off a head, a knight
must be paid a wage equal to one gold coin for each centimetre
of the knight's height."

Would there be enough knights to defeat the dragon? The king called on
his advisors to help him decide how many and which knights to hire.
After having lost a lot of money building Mir Park, the king wanted
to minimize the expense of slaying the dragon. As one of the advisors,
your job was to help the king. You took it very seriously: if you failed,
you and the whole kingdom would be burnt to a crisp!

The input contains several test cases. The first line of each test case
contains two integers between 1 and `20\ 000` inclusive, indicating the
number `n` of heads that the dragon has, and the number `m`
of knights in the kingdom. The next `n` lines each contain an
integer, and give the diameters of the dragon's heads, in centimetres.
The following `m` lines each contain an integer, and specify
the heights of the knights of Loowater, also in centimetres.

The last test case is followed by a line containing: "`0 0`".

For each test case, output a line containing the minimum number of
gold coins that the king needs to pay to slay the dragon. If it is not
possible for the knights of Loowater to slay the dragon, output the
line: "`Loowater is doomed!`"

Sample Input

2 3 5 4 7 8 4 2 1 5 5 10 0 0

Output for Sample Input

11 Loowater is doomed!