本题属于多维费用问题，只需要在一维的基础上加一维即可，枚举顺序和一维一样，这类问题还有多维体积问题，思路基本一样

多维体积传送门 https://www.acwing.com/problem/content/282/

C++ 代码

#include <bits/stdc++.h>
using namespace std;

const int N = 1010;

struct thing{
    int v, w, p;
};

vector<thing> things;

int dp[N][N];
int n, v, m;

int main(){
    cin >> n >> v >> m;

    for(int i = 0;i < n;++i){
        int v, w, p;
        cin >> v >> w >> p;
        things.push_back({v, w, p});
    }

    for(int i = 0;i < things.size();++i)
        for(int j = v;j >= things[i].v;--j)
            for(int k = m;k >= things[i].w;--k)
                dp[j][k] = max(dp[j][k], dp[j-things[i].v][k-things[i].w] + things[i].p);
    cout << dp[v][m];
}