emm 该说什么好 %%%
by 恶灬心 @ 2018-09-18 23:46:41
搜索：
```cpp#include <iostream>
#include <algorithm>
using namespace std;
int n,m,minn = 0x7ffffff,a[25];
int sum;
void dfs(int start,int cnt){
if(cnt == 0){
if(sum >= m) minn = min(minn,sum - m);
return;
}
for(int i = start;i <= n - cnt + 1;i++){
sum += a[i];
dfs(i + 1,cnt - 1);
sum -= a[i];
}
}
int main(){
cin >> n >> m;
for(int i = 1;i <= n;i++) cin >> a[i];
for(int i = 1;i <= n;i++){
int j = i;
dfs(1,j);
}
cout << minn;
return 0;
}
by LYM20114 @ 2021-11-07 09:43:17