Advertisement
Farjana_akter

Untitled

Jul 23rd, 2019
68
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.53 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int dp[2005][2005],weight[20000],price[20000];
  5. int main()
  6. {
  7. long long int i,j,k,capacity,n;
  8. cin>>capacity;
  9. cin>>n;
  10. for(i=1;i<=n;i++)
  11. {
  12. cin>>weight[i];
  13. cin>>price[i];
  14. }
  15.  
  16. for(i=1;i<=n;i++)
  17. {
  18. for(j=1;j<=capacity;j++)
  19. {
  20. if(j<weight[i])
  21. {
  22. dp[i][j]=dp[i-1][j];
  23. }
  24. else
  25. {
  26. dp[i][j]=max(dp[i-1][j-weight[i]]+price[i],dp[i-1][j]);
  27. }
  28. }
  29. }
  30.  
  31. cout<<dp[n][capacity]<<endl;
  32. return 0;
  33. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement