#include <iostream> #include <vector> #include <algorithm> #include <map> #include <set> #include <cmath> #include <numeric> #include <queue> #include <stack> #include <iomanip> using namespace std; void baseIO(string s = ""){ ios_base::sync_with_stdio(0); cin.tie(0); if (s.size()){ freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } } int main() { baseIO(); int s, n; cin >> s >> n; int dp[s + 1]{}; for (int i = 0; i < n; i++){ int a, b, c; cin >> a >> b >> c; c = min(c, s / b); while (c--){ for (int pos = s - b; pos >= 0; pos--){ dp[pos + b] = max(dp[pos + b], dp[pos] + a); } } } cout << *max_element(dp, dp + s + 1); return 0; }

knapsack.cpp: In function 'void baseIO(std::string)':
knapsack.cpp:17:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         freopen((s + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:18:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         freopen((s + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~