ソースコード
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i, s, e) for (ll(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (ll(i) = (s); (i) > (e); (i)--)
#define debug(x) cout << #x << ": " << x << endl
#define mp make_pair
#define pb push_back
const ll MOD = 1000000007;
const int INF = 1e9;
const ll LINF = 1e16;
const double PI = acos(-1.0);
int dx[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };
int dy[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
/* ----- 2017/08/01 Problem: KotamanegiOJ_Otemae D / Link: ----- */
/* ------問題------
-----問題ここまで----- */
/* -----解説等-----
----解説ここまで---- */
ll N;
int p[11];
ll S;
ll ans = LINF;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> N;
FOR(i, 0, N) {
cin >> p[i];
}
cin >> S;
FOR(i, 0, (1 << N)) {
ll m = 0;
FOR(j, 0, N) {
if (i&(1 << j))m += p[j];
}
if (m >= S)ans = min(ans, m);
}
if (ans == 0) {
sort(p, p + N);
ans = p[0];
}
cout << ans << endl;
return 0;
}