UVa 11559 - Event Planning

發表於 | 分類於 |

題目連結：UVa 11559 - Event Planning

解法

時間複雜度O(hw)

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <stdio.h>
int main() {
    int n, b, h, w, p, a, cost, i;
    while (scanf("%d %d %d %d", &n, &b, &h, &w) > 0) {
        cost = 1e9;
        while (h--) {
            scanf("%d", &p);
            for (i = 0; i < w; ++i) {
                scanf("%d", &a);
                if (a >= n && b >= n * p && cost > n * p)
                    cost = n * p;
            }
        }
        if (cost == 1e9)
            puts("stay home");
        else
            printf("%d\n", cost);
    }
    return 0;
}