POJ1742 Coins 【多重背包】

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int dp[100005];
int n, m;
int a[105], b[105], sum[100005];

int main() {
while( scanf("%d %d", &n, &m), n+m ) {
for ( int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
for (
4000
int i = 1; i <= n; i ++ ) scanf("%d", &b[i]);

memset(dp, 0, sizeof(dp));
dp[0] = 1;

int ans = 0;
for ( int i = 1; i <= n; i ++ ) {
memset(sum, 0, sizeof(sum));
for ( int j = a[i]; j <= m; j ++ ) {
if(!dp[j] && dp[j-a[i]] && sum[j-a[i]] < b[i]) {
dp[j] = 1;
sum[j] = sum[j-a[i]]+1;
ans ++;
}
}
}
printf("%d\n", ans);
}

return 0;
}