fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. typedef long long ll;
  5. const int MAX = 110;
  6.  
  7. ll n,W,w[MAX], v[MAX];
  8. ll dp[MAX][100010];
  9.  
  10. int main(){
  11.  
  12. cin >> n >> W;
  13. for(ll i = 1; i <= n; i++) cin >> w[i] >> v[i];
  14. for(ll i = 1; i<=n; i++){
  15. for(ll j = 0; j<=W; j++){
  16. if(j < w[i])
  17. dp[i][j] = dp[i-1][j];
  18. else
  19. dp[i][j] = max(dp[i-1][j], dp[i-1][j-w[i]] + v[i]);
  20. }
  21. }
  22.  
  23. cout << dp[n][W] << endl;
  24. }
Success #stdin #stdout 0s 5320KB
stdin
Standard input is empty
stdout
0