Advertisement
a53

Rucsac2

a53
Apr 20th, 2019
243
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.45 KB | None | 0 0
  1. #include <iostream>
  2. #include <cstring>
  3. using namespace std;
  4. int n,G,g[1001],v[1001];
  5.  
  6. int rucsac(int G,int n,int g[],int v[])
  7. {
  8. int dp[G+1];
  9. memset(dp,0,sizeof dp);
  10. for(int i=0;i<=G;++i)
  11. for(int j=0;j<n;++j)
  12. if (g[j]<=i)
  13. dp[i]=max(dp[i],dp[i-g[j]]+v[j]);
  14. return dp[G];
  15. }
  16.  
  17. int main ()
  18. {
  19. cin>>n>>G;
  20. for(int i=0;i<n;++i)
  21. cin>>g[i]>>v[i];
  22. cout<<rucsac(G,n,g,v);
  23. return 0;
  24. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement