P1048 [NOIP2005 普及组] 采药

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

const LL MAXn = 10000;
const LL MAXW = 10000000;

LL n, W;
LL d[MAXW + 10];

inline LL read() {
    register char c;
    while (c = getchar(), c < '0' || c >'9');
    register LL x(c - '0');
    while (c = getchar(), c >= '0' && c <= '9') {
        x = x * 10 + c - '0';
    }
    return x;
}

inline LL max(LL a, LL b) {
    return a > b ? a : b;
}

int main() {
    W = read();
    n = read();
    LL w, v;
    for (LL i = 0; i < n; i++) {
        w = read();
        v = read();
        for (LL i = W; i >= w; i--) {
            d[i] = max(d[i], d[i - w] + v);
        }
    }
    printf("%lld", d[W]);
}