http://acm.hdu.edu.cn/showproblem.php?pid=2191

题解：多重背包

参考文章：https://blog.csdn.net/weixin_43272781/article/details/83214622

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=1000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,w,v;
int ans,cnt,flag,temp;
int dp[N];
char str;
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d",&t);
    while(t--){
        scanf("%d%d",&n,&m);
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=m;i++){
            scanf("%d%d%d",&v,&w,&q);
            for(int j=n;j>=v;j--){
                for(int k=1;k<=q&&j-k*v>=0;k++){
                    dp[j]=max(dp[j],dp[j-k*v]+k*w);
                }
            }
        }
        printf("%d\n",dp[n]);
    }
    //cout << "Hello world!" << endl;
    return 0;
}