ICode9

AcWing2.01背包问题 题解 二维 #include <iostream> using namespace std; const int N = 1010; int dp[N][N]; int v[N], w[N]; int main() { int n, V; cin >> n >> V; for(int i = 1; i <= n; ++i) cin >> v[i] >> w[i