失衡天平

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define MP make_pair
typedef long long ll;
const int M=102;
const int inf=0x3f3f3f3f;
const ll INF=1e18;
int a[M],dp[M][M*M+10];
int main(){
    int n,m;
    int sum=0;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]),sum+=a[i];
    memset(dp, -0x3f, sizeof(dp));
    dp[0][0] = 0;
    for(int i=1;i<=n;i++)
        for(int j=0;j<=sum;j++){
            dp[i][j]=dp[i-1][j];
            dp[i][j]=max(dp[i][j],max(dp[i-1][j+a[i]],dp[i-1][abs(j-a[i])])+a[i]);
        }
    int ans=0;
    for(int i=0;i<=m;i++)
        ans=max(ans,dp[n][i]);
    printf("%d\n",ans);
    return 0;
}