Function main

Dynamic Programming Optimizations/Bounded Knapsack.cpp:36–48

  return ans;
}
int32_t main() {
  int i, j, k, n, m;
  n = 10;
  int W = 100;
  vector<int> ps(n), ws(n), ms(n);
  for (int i = 0; i < n; ++i) {
    ps[i] = rand() % n + 1;
    ws[i] = rand() % n + 1;
    ms[i] = rand() % n + 1;
  }
  cout << boundedKnapsack(ps, ws, ms, W) << endl;
  return 0;
}