HDU 2159 FATE【二维多重背包】

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;

const int maxn = 105;
int dp[maxn][maxn];
int a[maxn], b[maxn];

int main() {
int n, m, s, k;
while(EOF != scanf("%d %d %d %d",&n, &m, &k, &s) ) {
for(int i = 1; i <= k; i++) {
scanf("%d %d",&a[i], &b[i]);
}
memset(dp, 0, sizeof(dp));
for(int i = 1; i <= k; i++) {
for(int j = b[i]; j <= m; j++) {
for(int l = 1; l <= s; l++) {
dp[j][l] = max(dp[j][l], dp[j - b[i]][l - 1] + a[i]);
}
}
}
int ans = -1;
for(int j = 0; j <= m; j++) {
for(int l = 0; l <= s; l++) {
if(dp[j][l] >= n) {
ans = max(ans, m - j);
}
}
}
printf("%d\n", ans);
}
return 0;
}