30分求调

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int N = 100;

int n, BeginLevel, MaxLevel;
int c[N];
bool dp[N][2];

int main() {
	scanf("%d %d %d", &n, &BeginLevel, &MaxLevel);
	for (int i = 1; i <= n; i++) scanf("%d", &c[i]);

	memset(dp, false, sizeof dp);
	dp[0][BeginLevel] = true;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j <= MaxLevel; j++) {
			if (dp[i - 1][j]) {
				if (j + c[i] <= MaxLevel) dp[i][j + c[i]] = true;
				if (j - c[i] >= 0) dp[i][j - c[i]] = true;
			}
		}
	}

	for (int i = MaxLevel; i >= 0; i--) {
		if (dp[n][i]) {
			printf("%d\n", i);
			return 0;
		}
	}
	printf("-1\n");
	return 0;
}