S5來襲4/11旗艦上市老王現身說法關鍵字魅力!攝影界美人正妹指定相機款黃曉明、林志玲攜手代言...
2012-04-14 20:02:11 人氣(351) | 回應(0) | 推薦(0) | 收藏(0) 上一篇 | 下一篇

[UVA] 11559 - Event Planning

0
收藏
0
推薦


  Event Planning 

epsfbox{p115xx.eps}

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.

Input 

The input file contains several test cases, each of them as described below.

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

Output 

For each test case, write to the output the minimum cost of the stay for your group, or ``stay home'' if nothing can be found within the budget, on a line by itself.

Sample Input 

3 1000 2 3
200
0 2 2
300
27 3 20
5 2000 2 4
300
4 3 0 4
450
7 8 0 13

Sample Output 

900
stay home

 

#include <stdio.h>

int main() {
    int N, B, H, W;
    int P, i, a;
    while(scanf("%d %d %d %d", &N, &B, &H, &W) == 4) {
        int min = B+1;
        while(H--) {
            scanf("%d", &P);
            for(i = 0; i < W; i++) {
                scanf("%d", &a);
                if(a >= N && N*P < min)
                    min = N*P;
            }
        }
        if(min == B+1)
            puts("stay home");
        else
            printf("%d\n", min);
    }
    return 0;
}


11559Event Planning
台長:Morris
人氣(351) | 回應(0)| 推薦 (0)| 收藏 (0)| 轉寄
全站分類: 不分類 | 個人分類: UVA |
此分類下一篇:[UVA] 11799 - Horror Dash
此分類上一篇:[UVA][DP] 12063 - Zeros and Ones

我要回應
是 (若未登入"個人新聞台帳號"則看不到回覆唷!)
* 請輸入識別碼:
請輸入以下數字 (ex:123)

(有*為必填)
詳全文