CSP何以包邮

#include <bits/stdc++.h>
using namespace std;
const int maxn = 30 + 5;
const int maxs = 3e5 + 5;
int n, x, sum;
int a[maxn];
int dp[maxs];
int main()
{
    cin >> n >> x;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        sum += a[i];
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = sum - x; j >= a[i]; j--)
        {
            dp[j] = max(dp[j], dp[j - a[i]] + a[i]);
        }
    }
    cout << sum - dp[sum - x];
}