显示代码纯文本
#include <bits/stdc++.h>
using namespace std;
int N,W,a[20];
int ans=99999999,b[20];
bool cmp(int x,int y){
if(x>y) return true;
else return false;
}
void dfs(int now,int cnt){
if(cnt>=ans) return;
if(now==N+1){
if(cnt<ans) ans=cnt;
return;
}
for(int i=1;i<=cnt;i++){
if(b[i]+a[now]<=W){
b[i]+=a[now];
dfs(now+1,cnt);
b[i]-=a[now];
}
}
b[cnt+1]=a[now];
dfs(now+1,cnt+1);
b[cnt+1]=0;
}
int koneko123(){
freopen("koneko.in","r",stdin);
freopen("koneko.out","w",stdout);
scanf("%d%d",&N,&W);
for(int i=1;i<=N;i++) scanf("%d",&a[i]);
sort(a+1,a+N+1,cmp);
dfs(1,0);
printf("%d",ans);
return 0;
}
int huhu=koneko123();
int main(){;}