WA on #1 #4 #6

#include<bits/stdc++.h>
using namespace std;

const int Maxn = 505;
const int C = 1e5 + 5;

int n, c[Maxn], sum;
int dp[Maxn][C];
int main(){
    cin >> n;
    for(int i = 1; i <= n; i ++){
        cin >> c[i];
        sum += c[i];
    }

    memset(dp, -0x3f, sizeof(dp));
    for(int i = 0; i <= n; i ++) dp[i][0] = 0;
    for(int i = 1; i <= n; i ++){
        for(int j = 0; j <= sum; j ++){
            if(j < c[i]) dp[i][j] = max(dp[i - 1][j + c[i]], dp[i - 1][j]);
            else dp[i][j] = max(dp[i - 1][j - c[i]] + c[i], max(dp[i - 1][j], dp[i - 1][j + c[i]]));
        }
    }

    cout << sum - dp[n][0];
    return 0;
}

https://www.luogu.com.cn/record/226534925 这是测试记录