代码:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
using namespace std;
int n,v;
void bag(vector<int>&dp,vector<int>&value,vector<int>&weight){
for(int i=0;i<n;i++){
for(int j=v;j>=weight[i];j--){
dp[j]=max(dp[j],dp[j-weight[i]]+value[i]);
}
}
cout<<dp[v];
}
int main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
cin>>n>>v;
vector<int>dp(v+1,0);
int vi,wi;
vector<int>value(n);
vector<int>weight(n);
for(int i=0;i<n;i++){
cin>>wi>>vi;
weight[i]=wi;
value[i]=vi;
}
bag(dp,value,weight);
return 0;
}