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 C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Diagnostics;
class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	
	const int MB = 64;
	public void Solve(){
		
		int sum = A.Sum();
		Array.Sort(A);
		int NN = (sum + 1  + MB - 1) / MB + 10;
		ulong[] dp = new ulong[NN];
		//dp[0] = 1;
		int tt = 0;
		for(int i=0;i<N;i++){
			ulong[] ndp = new ulong[NN];
			tt += A[i];
			int nn = (tt + 1 + MB - 1) / MB;
			int nj = A[i] / MB;
			int nb = A[i] % MB;
			if(i == 0){
				dp[nj] = 1UL << nb;
				continue;
			}
			for(int j=0;j + nj < NN;j++){
				//if(dp[j] == 0) continue;
				ndp[j] |= dp[j];
				ndp[j + nj] |= dp[j] << nb;
				if(j + nj + 1 < NN) ndp[j + nj + 1] |= dp[j] >> (MB - nb);
			}
			dp = ndp;
		}
		for(int k = (sum + 1) / 2;k <= sum; k++){
			int ii = k / MB;
			int jj = k % MB;
			if(((dp[ii] >> jj) & 1 ) == 1){
				Console.WriteLine(k);
				return;
			}
		}
		
		
	}
	int N;
	int[] A;

	public Sol(){
		N = ri();
		A = ria();
	}

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}