DCJSPCHIPS的博客

题目描述：代码：这里直接用了优化过的#include<bits/stdc++.h>using namespace std;const int N = 1005;int v[N], w[N], f[N];int n,m;//物品数量和背包容积 int main(){ scanf("%d %d",&n,&m); for(int i = 1; i <= n; i++) scanf("%d %d",&v[i],&w[i]); f