ソースコード
// 基本テンプレート
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;
int N, S, P[15];
int dp[15][10001];
signed main() {
cin >> N;
rep(i,0,N) {
cin >> P[i];
}
dp[0][0] = 1;
rep(i,0,N) repq(j,0,10001) {
dp[i+1][j] |= dp[i][j];
if(j - P[i] < 0) continue;
dp[i+1][j] |= dp[i][j - P[i]];
}
cin >> S;
rep(i,max(1LL,S),10001) {
if(dp[N][i]) {
cout << i << endl;
return 0;
}
}
return 0;
}