Submission #1551927

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
//#define int long long

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()

const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const ll INF = 1<<30;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;

int n, m;
int a[55];
vector<int> s1;
vector<int> s2;

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n >> m;
    rep(i, n) cin >> a[i];
    int n1 = n / 2;
    int n2 = n - n1;
    rep(i, 1<<n1) {
        int tmp = 0;
        rep(j, n1) {
            if (i>>j&1) tmp += a[j];
        }
        s1.push_back(tmp);
    }
    sort(all(s1));
    rep(i, 1<<n2) {
        int tmp = 0;
        rep(j, n2) {
            if (i>>j&1) tmp += a[j + n1];
        }
        s2.push_back(tmp);
    }
    sort(all(s2));
    int ans = 10000000;
    rep(i, s1.size()) {
        int idx = lower_bound(all(s2), m - s1[i]) - s2.begin();
        if (idx == s2.size()) continue;
        ans = min(ans, s1[i] + s2[idx]);
    }
    if (ans == 10000000) cout << -1 << endl;
    else cout << ans << endl;
}

Submission Info

Judge Result