2382. Event Planning

单点时限: 2.0 sec

内存限制: 256 MB

As you didn’t show up to the yearly general meeting of the Nordic Club of Pin Collectors, you were unanimously elected to organize this years excursion to Pin City. You are free to choose from a number of weekends this autumn, and have to find a suitable hotel to stay at, preferably as cheap as possible.

You have some constraints: The total cost of the trip must be within budget, of course. All participants must stay at the same hotel, to avoid last years catastrophe, where some members got lost in the city, never being seen again.


The fi rst line of input consists of four integers: 1 ≤N ≤200, the number of participants, 1 ≤B ≤500000, the budget, 1 ≤H ≤18, the number of hotels to consider, and 1 ≤W ≤13, the number of weeks you can choose between. Then follow two lines for each of the H hotels. The fi rst gives 1 ≤p ≤10000, the price for one person staying the weekend at the hotel. The second contains W integers, 0 ≤a ≤1000, giving the number of available beds for each weekend at the hotel.


Output the minimum cost of the stay for your group, or “stay home” if nothing can be found within the budget.


3 1000 2 3
0 2 2
27 3 20
5 2000 2 4
4 3 0 4
7 8 0 13
stay home

34 人解决,37 人已尝试。

38 份提交通过,共有 131 份提交。

3.9 EMB 奖励。

创建: 15 年,6 月前.

修改: 6 年,7 月前.

最后提交: 8 月,2 周前.

来源: NCPC 2008