Problem:
Score : 700 points

Problem Statement

You are given N integers A_1, A_2, ..., A_N.

Consider the sums of all non-empty subsequences of A. There are 2^N - 1 such sums, an odd number.

Let the list of these sums in non-decreasing order be S_1, S_2, ..., S_{2^N - 1}.

Find the median of this list, S_{2^{N-1}}.

Constraints

1 \leq N \leq 2000

1 \leq A_i \leq 2000

All input values are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the median of the sorted list of the sums of all non-empty subsequences of A.

Sample Input 1

3
1 2 1

Sample Output 1

2

In this case, S = (1, 1, 2, 2, 3, 3, 4). Its median is S_4 = 2.

Sample Input 2

1
58

Sample Output 2

58

In this case, S = (58).

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

#[allow(unused_imports)]
use std::io::*;
#[allow(unused_imports)]
use std::str::*;
#[allow(unused_imports)]
use std::mem::*;
#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
#[allow(unused_imports)]
use std::usize;

#[allow(dead_code)]
fn read<T: FromStr>() -> T {
    let mut line = String::new();
    stdin().read_line(&mut line).unwrap();
    line.trim().to_string().parse().ok().unwrap()
}

#[allow(dead_code)]
fn read_cols<T: FromStr>() -> Vec<T> {
    let mut line = String::new();
    stdin().read_line(&mut line).unwrap();

    line.trim()
        .split_whitespace()
        .map(|s| s.parse().ok().unwrap())
        .collect()
}

type BitSetElement = u8;
struct BitSet {
    storage: Vec<BitSetElement>,
}

impl BitSet {
    fn unit_size() -> usize {
        size_of::<BitSetElement>()
    }

    fn unit_size_bit() -> usize {
        8 * Self::unit_size()
    }

    fn new(size: usize, default: bool) -> BitSet {
        let mut storage = Vec::new();
        if default {
            storage.resize(
                (size - 1) / Self::unit_size_bit() + 1,
                (-1i8) as BitSetElement,
            );
        } else {
            storage.resize((size - 1) / Self::unit_size_bit() + 1, 0);
        }
        BitSet { storage: storage }
    }

    fn set(&mut self, pos: usize) {
        self.storage[pos / 8] |= 1 << (pos % 8);
    }

    fn unset(&mut self, pos: usize) {
        self.storage[pos / 8] &= !(1 << (pos % 8));
    }

    fn get(&self, pos: usize) -> bool {
        if pos / 8 >= self.storage.len() {
            return false;
        }
        self.storage[pos / 8] & (1 << (pos % 8)) > 0
    }

    /// self.get(i) | other.get(i-shift)
    fn or_with_shift(&self, other: &BitSet, shift: usize) -> BitSet {
        let shift_byte = (shift + 7) / 8;
        let byte_size = max(self.storage.len(), other.storage.len() + shift_byte);
        let mut storage = Vec::with_capacity(byte_size);

        for i in 0..byte_size {
            storage.push(0);
            if shift_byte <= i && i < other.storage.len() + shift_byte {
                storage[i] |= other.storage[i - shift_byte] >> (8 - shift % 8);
            }
            if i + 1 >= shift_byte && i + 1 < other.storage.len() + shift_byte {
                storage[i] |= other.storage[i + 1 - shift_byte] << (shift % 8);
            }
            if i < self.storage.len() {
                storage[i] |= self.storage[i];
            }
        }

        BitSet { storage: storage }
    }
}

/// Returns the minimum partial sum of nums,
/// greater than or equal to bound.
fn calc_iterative(nums: &[usize], bound: usize, sums: &[usize]) -> usize {
    if bound <= 0 {
        return 0;
    }

    let mut dp = BitSet::new(nums[0] + 1, false);
    dp.set(0);
    dp.set(nums[0]);

    for (_i, &num) in nums.iter().enumerate().skip(1) {
        let next_dp = dp.or_with_shift(&dp, num);
        dp = next_dp;
    }

    let sum = sums[nums.len() - 1];
    for i in bound..sum + 1 {
        if dp.get(sum - i) {
            return i;
        }
    }

    0
}

fn main() {
    let n = read::<usize>();
    let nums = {
        let mut nums = read_cols::<usize>();
        nums.sort();
        nums
    };
    assert_eq!(n, nums.len());

    // Idea:
    //  When S=a_1+...+a_n and S_i (i=1, ...) is i-th partial sum
    //  in ascending order and S_0 = 0,
    //  S_{2^n-1-i} = S - S_i,
    //  and if S_i <= S/2, then S_{2^n-1-i} >= S/2.
    //  By this fact, minimum S_k where satisfies S_k >= S/2
    //  is the median of partial sums.
    let sums = nums.iter()
        .scan(0, |sum, &num| {
            *sum += num;
            Some(*sum)
        })
        .collect::<Vec<_>>();

    let total_sum = sums.last().unwrap();
    // let answer = calc_partial_sum_lower_bound(&nums, (total_sum + 1) / 2, &sums, &mut cache);
    let answer = calc_iterative(&nums, (total_sum + 1) / 2, &sums);

    println!("{}", answer);
}