knapsack.cpp

#include <iostream>
#include <vector>
#include <algorithm>

#define MAX 2000

using namespace std;

int main() {
  int t;
  cin >> t;
  for (int i = 0; i != t; ++i) {
    int n, k;
    vector<int> v;
    cin >> n >> k;
    for (int j = 0; j != n; ++j) {
      int a;
      cin >> a;
      v.push_back(a);
    }
    int dp[MAX + 1] = {0};
    for (int i = 0; i < n; ++i)
      for (int j = 0; j <= k; ++j)
        if (j >= v[i]) dp[j] = max(dp[j], dp[j - v[i]] + v[i]);
    cout << dp[k] << endl;
  }
  return 0;
}