-
Notifications
You must be signed in to change notification settings - Fork 1
/
F.cpp
93 lines (78 loc) · 1.54 KB
/
F.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
// //#pragma GCC optimize "trapv"
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("O3", "unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include<iostream>
#include<algorithm>
#include<vector>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define pb push_back
#define endl "\n"
#define f first
#define se second
#define all(x) x.begin(),x.end()
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
void getsubset( vector<ll> a,vector<ll> &s, ll k)
{
int n=a.size();
fab(0,(1<<n),i)
{
ll sum=0;
fab(0,n,j)
{
if(i&(1<<j))
{
sum+=a[j];
}
}
if(sum<=k)
s.pb(sum);
}
}
int main()
{ quick;
ll n,k;
cin>>n>>k;
vector<ll> a(n);
fab(0,n,i)
{
cin>>a[i];
}
vector<ll> a1,a2;
fab(0,n/2,i)
a1.pb(a[i]);
fab(n/2,n,i)
{
a2.pb(a[i]);
}
// for(auto p: a1)
// {
// cout<<p<<" ";
// }
// cout<<endl;
// for(auto p: a2)
// {
// cout<<p<<" ";
// }
// cout<<endl;
vector<ll> op,dp;
getsubset(a1,op,k);
getsubset(a2,dp,k);
sort(all(op));
ll ans=0;
for(auto i: dp)
{
ll rem=k-i;
auto j=lower_bound(all(op),rem+1)-op.begin();
j--;
if(j>=0)
{
ans=max(ans,i+op[j]);
}
}
cout<<ans<<endl;
//cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}