二维费用

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f, MOD = 1E9 + 7;
const int N = 1e3 + 5, M = 105;
int n, m, q, v1[N], v2[N], w[N], f[M][M];

int main(int argc, char* argv[]) {
    cin >> n >> m >> q;
    for (int i = 1; i <= n; i++)
        cin >> v1[i] >> v2[i] >> w[i];
    for (int i = 1; i <= n; i++)
        for (int j = m; j >= v1[i]; j--)
            for (int k = q; k >= v2[i]; k--)
                f[j][k] = max(f[j][k], f[j - v1[i]][k - v2[i]] + w[i]);
    cout << f[m][q];
    return 0;
}