fork download
  1. #include<bits/stdc++.h>
  2.  
  3. #define ll long long
  4. #define pp push_back
  5. #define endl '\n'
  6. #define all(x) x.begin(),x.end()
  7. #define ld long double
  8. #define PI acos(-1)
  9. #define ones(x) __builtin_popcountll(x)
  10. //#define int ll
  11.  
  12. using namespace std;
  13.  
  14. void Drakon() {
  15. ios_base::sync_with_stdio(false);
  16. cin.tie(nullptr);
  17. cout.tie(nullptr);
  18. #ifdef Clion
  19. freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  20. #endif
  21. }
  22.  
  23. unsigned long long inf = 1e10;
  24. const double EPS = 1e-6;
  25. const int MOD = 1000000007, N = 105, M = 1005, LOG = 25;
  26.  
  27. ll mul(const ll &a, const ll &b) {
  28. return (a % MOD + MOD) * (b % MOD + MOD) % MOD;
  29. }
  30.  
  31. ll add(const ll &a, const ll &b) {
  32. return (a + b + 2 * MOD) % MOD;
  33. }
  34.  
  35. ll pw(ll x, ll y) {
  36. ll ret = 1;
  37. while (y > 0) {
  38. if (y % 2 == 0) {
  39. x = mul(x, x);
  40. y = y / 2;
  41. } else {
  42. ret = mul(ret, x);
  43. y = y - 1;
  44. }
  45. }
  46. return ret;
  47. }
  48.  
  49. int dp[N][M], h[N], c[N], n;
  50.  
  51. int slv(int i, int remCost) {
  52. if(i == n) {
  53. return 0;
  54. }
  55. int &ret = dp[i][remCost];
  56. if(~ret)
  57. return ret;
  58. ret = slv(i + 1, remCost);
  59. if(c[i] <= remCost)
  60. ret = max(ret, slv(i + 1, remCost - c[i]) + h[i]);
  61. return ret;
  62. }
  63.  
  64. void solve() {
  65. int m;
  66. cin >> n >> m;
  67. for (int i = 0; i < n; ++i) {
  68. cin >> h[i];
  69. }
  70. for (int i = 0; i < n; ++i) {
  71. cin >> c[i];
  72. }
  73. memset(dp, -1, sizeof dp);
  74. cout << slv(0, m);
  75. }
  76.  
  77. signed main() {
  78. Drakon();
  79. int t = 1;
  80. //cin >> t;
  81. while (t--) {
  82. solve();
  83. }
  84. }
Success #stdin #stdout 0.01s 5332KB
stdin
Standard input is empty
stdout
Standard output is empty