AcWing 8. 二维费用的背包问题
代码
#include <bits/stdc++.h>
#define int long long
using namespace std;const int N = 1010, mod = 1e9 + 7;int n, m, k, x, y, z, ans, t;
int w[N], f[N][N];void solve()
{cin >> n >> m >> k;for (int i = 1; i <= n; i ++ ){cin >> x >> y >> z;for (int j = m; j >= x; j -- ){for (int l = k; l >= y; l -- ){f[j][l] = max(f[j][l], f[j - x][l - y] + z);}}}cout << f[m][k] << "\n";
}signed main()
{ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);int T = 1;
// cin >> T;while (T -- ){solve();}
}