Submission #2551483

---

Source Code Expand

#include <iostream>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>

using namespace std;
typedef long long ll;


typedef pair<ll,ll> P;
long long int INF = 1e18;
double Pi = 3.141592653589;
const int mod = 1000000007;
// memset(a,0,sizeof(a)); →全部０にする

vector<int> G[100005];
std::vector<P> tree[100010];

int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};

#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define re(i,a,b) for(i=a;i<=b;i++)

ll i,j,ii,jj;
ll n,m;
ll num,sum;
bitset<2000005> dp;

int main(){
    cin>>n;
    dp[0]=1;
    for(i=0;i<n;i++){
        cin>>m;
        sum+=m;
        dp |= dp<<m;
    }
    for(i=(sum+1)/2;i<=2000004;i++){
        if(dp[i]){
            p(i);
            return 0;
        }
    }
    return 0;
}

Submission Info

Judge Result