1782. Knapsack

soj.me/1782

// Problem#: 1782// Submission#: 1211799// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/// All Copyright reserved by Informatic Lab of Sun Yat-sen University#include<iostream>using namespace std;int size[1000] = {0};int maxValue[10000] = {0};//maxValue[j] 把物品放進去容量剩下j的背包，創造的最大價值 int max(const int& a, const int b){    return a>b?a:b; }int main(){    int t;       cin>>t;        while(t--){        int n,c;                              cin>>n>>c;        for(int k = 0; k < n; k++){            cin>>size[k];        }        for(int i = 1; i <= n; i++){            for(int j = c; j >= size[i-1]; j--){                maxValue[j] = max(maxValue[j],maxValue[j-size[i-1]]+size[i-1]);                }        }        cout<<maxValue[c]<<endl;    }     return 0;}