C题求调

#include <bits/stdc++.h>
using namespace std;
long long n, m, sum, w[114], dp[250];

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> w[i];
		sum += w[i];
	}
	m = sum / 2;
	for (int i = 1; i <= n; i++)
		for (int j = m; j >= w[i]; j--)
			dp[j] = max(dp[j], dp[j - w[i]] + w[i]);
	cout << max(dp[m], sum - dp[m]) << endl;
	return 0;
}