이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
const int S = 1e5 + 10;
int n;
bool dp[S];
int main(){
cin >> n;
dp[0] = 1;
int total = 0;
for (int i = 0; i < n; i ++){
int x;
cin >> x;
total += x;
for (int sm = S - 1; sm >= x; sm --)
dp[sm] |= dp[sm - x];
}
int mx = 0;
for (int x = 0; 2 * x < S; x ++)
if (dp[x] and dp[2 * x])
mx = max(mx, x);
cout << mx + (total - 2 * mx) << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |