sicily 1782.Knapsack

//转化成01背包问题#include <stdio.h>#include <iostream>#include <memory.h>using namespace std;int dp[10001];int main(){int caseNum;cin >> caseNum;while(caseNum--){int n,m;//n为物品个数，m为背包容量cin >> n >> m;int w[1001];for(int i = 0; i < n;i++){cin >> w[i];}memset(dp,0,sizeof(dp));dp[0] = 0;for(int i = 0; i < n;i++)for(int j = m; j >= w[i];j--)dp[j] = max(dp[j],dp[j - w[i]] + w[i]);cout << dp[m] << endl;}return 0;}