#include <iostream> #include<bits/stdc++.h> //与01背包区别不大,就下面两处,恰好装满时的解决思路也是和01背包一模一样 #include <vector> using namespace std; int main() { int n,V; cin>>n>>V; vector<int >v(n+1,0); vector<int>w(n+1,0); vector<int>dp1(V+1,0); vector<int>dp2(V+1,-1111...