完全背包

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;

int t;
int n,m;
int a[410];
int dp[80010];

int main()
{
    cin >> t;
    while(t--)
    {
        cin >> n >> m;
        for(int i = 1;i <= n;i ++)
            cin >> a[i];
        sort(a+1,a+n+1);
        memset(dp,0,sizeof(dp));
        for(int i = 1;i < n;i ++)
            for(int j = m-1;j >= a[i];j --)
                dp[j] = max(dp[j],dp[j-a[i]]+a[i]);
        cout << dp[m-1] + a[n] << endl;
    }
    return  0;
}