Submission #1042910

#	Time	Username	Problem	Language	Result	Execution time	Memory
1042910		VMaksimoski008	Kas (COCI17_kas)	C++17	100 / 100	220 ms	392524 KiB

kas

#include <iostream>
using namespace std;

const int M = 1e5 + 5;

int dp[505][2*M+5], v[505];

int main() {
    int n, S = 0;
    cin >> n;

    for(int i=1; i<=n; i++) cin >> v[i], S += v[i];
    for(int j=0; j<=2*M; j++) dp[0][j] = -1e9;
    dp[0][M] = 0;

    for(int i=1; i<=n; i++) {
        for(int j=0; j<=2*M; j++) {
            dp[i][j] = dp[i-1][j];
            if(j + v[i] <= 2 * M) dp[i][j] = max(dp[i][j], dp[i-1][j+v[i]] + v[i]);
            if(j - v[i] >= 0) dp[i][j] = max(dp[i][j], dp[i-1][j-v[i]] + v[i]);
        }
    }

    cout << S - dp[n][M] / 2 << '\n';
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10