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 = 1e3 + 4, 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][N], w[N], p[N], n;
  50.  
  51. int slv(int i, int rem) {
  52. if(i == n) return 0;
  53. int &ret = dp[i][rem];
  54. if(~ret)
  55. return ret;
  56. ret = slv(i + 1, rem);
  57. if(w[i] <= rem)
  58. ret = max(ret, slv(i + 1, rem - w[i]) + p[i] - w[i]);
  59. return ret;
  60. }
  61.  
  62. void solve() {
  63. int k;
  64. cin >> n >> k;
  65. for (int i = 0; i < n; ++i) {
  66. cin >> w[i] >> p[i];
  67. }
  68. for (int i = 0; i < n; ++i) {
  69. for (int j = 0; j <= k; ++j) {
  70. dp[i][j] = -1;
  71. }
  72. }
  73. cout << slv(0, k) << endl;
  74. }
  75.  
  76. signed main() {
  77. Drakon();
  78. int t = 1;
  79. cin >> t;
  80. while (t--) {
  81. solve();
  82. }
  83. }
Success #stdin #stdout 0.01s 5320KB
stdin
Standard input is empty
stdout
0