0-1背包问题-1和-2都可以用

#include <cstdio>
#include <iostream>
using namespace std;
const int N = 1e6 + 10;
int a[N], w[N], v[N], vs[N];

int main(void) {
	int n, m;
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	for (int i = 1; i <= n; i++) {
		scanf("%d", &w[i]);
	}
	for (int i = 1; i <= n; i++) {
		for (int j = a[i]; j <= m; j++) {
			v[j] = max(v[j], vs[j - a[i]] + w[i]);
		}
		for (int j = a[i]; j <= m; j++) {
			vs[j] = v[j];
		}
	}
printf("%d ", v[m]);
	return 0;

}