Submission #58457793

---

Source Code Expand

/*Code by Leo2011*/
#include <bits/stdc++.h>

#define INF 0x3f3f3f3f
#define EPS 1e-8
#define FOR(i, l, r) for (int(i) = (l); (i) <= (r); ++(i))
#define log printf
#define IOS                      \
	ios::sync_with_stdio(false); \
	cin.tie(nullptr);            \
	cout.tie(nullptr);

using namespace std;

typedef __int128 i128;
typedef long long ll;
typedef pair<int, int> PII;

const int N = 30;
int n, a[N], ans = INF, sum;

template <typename T>

inline T read() {
	T sum = 0, fl = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar())
		if (ch == '-') fl = -1;
	for (; isdigit(ch); ch = getchar()) sum = sum * 10 + ch - '0';
	return sum * fl;
}

template <typename T>

inline void write(T x) {
	if (x < 0) {
		putchar('-'), write<T>(-x);
		return;
	}
	static T sta[35];
	int top = 0;
	do { sta[top++] = x % 10, x /= 10; } while (x);
	while (top) putchar(sta[--top] + 48);
}

void dfs(int group, int cnt) {
	if (group == n) {
		ans = min(ans, max(cnt, sum - cnt));
		return;
	}
	dfs(group + 1, cnt + a[group]);
	dfs(group + 1, cnt);
}

int main() {
	n = read<int>();
	FOR(i, 1, n) a[i] = read<int>(), sum += a[i];
	dfs(1, 0);
	write<int>(ans);
	return 0;
}
// 20组---》爆搜挂着机，打表出AC

Submission Info

Judge Result