problem
solution
codes
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
int n, mass, ans(666), f[233];
map<int, int>ma;
void dfs1(int k, int cur, int sum){
if(sum>mass || cur>n/2)return ;
ma[sum] = k;
dfs1(k+1,cur+1,sum+f[cur]);
dfs1(k,cur+1,sum);
}
void dfs2(int k, int cur, int sum){
if(sum>mass || cur>n)return ;
if(ma.find(mass-sum) != ma.end()){
ans = min(ans,k+ma[mass-sum]);
return;
}
dfs2(k+1,cur+1,sum+f[cur]);
dfs2(k,cur+1,sum);
}
int main(){
cin>>n>>mass;
for(int i = 0; i < n; i++)
cin>>f[i];
dfs1(0,0,0);
dfs2(0,n/2,0);
cout<<ans<<"
";
return 0;
}