Advertisement
Guest User

Untitled

a guest
Dec 8th, 2019
87
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.51 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. int main()
  6. {
  7. int n, GMax, i, j;
  8. int V[1005], G[1005];
  9.  
  10. cin >> n >> GMax;
  11. for(i = 0; i < n; ++i)
  12. cin >> G[i] >> V[i];
  13.  
  14.  
  15. int rucsac[10005];
  16. rucsac[0] = 0; // Cu 0kg, obtinem valoarea 0
  17.  
  18. for(j = 1; j <= GMax; ++j)
  19. {
  20. rucsac[j] = 0;
  21. for(i = 0; i < n; ++i)
  22. if(G[i] <= j)
  23. rucsac[j] = max(rucsac[j], rucsac[j-G[i]] + V[i]);
  24. }
  25.  
  26. cout << rucsac[GMax];
  27. return 0;
  28. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement