排版，大佬！
by B_1168 @ 2018-05-15 22:05:41
@[stewart](/space/show?uid=62562) 不太会，大佬，我直接复制代码就这样了
by 37qwq @ 2018-05-16 10:38:54
好吧，我还是去用搜索吧
by 37qwq @ 2018-05-16 10:46:04
```cpp
include<stdio.h>
include<algorithm>
using namespace std;
int a[2500000],ss[250000000],n,b,s=0;
int main()
{
int i,j,max,p=1;
scanf("%d %d",&n,&b);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
sort(a+1,a+n+1);
for(i=1;i<=n;i++)
ss[i]=100000000;
for(i=1;i<=n;i++)
{
s=a[i];
for(j=i+1;j<=n;j++)
{
if(s>=b)
ss[p]=s-b;
s+=a[j]; p++;
}
}
max=100000;
for(i=1;i<=n;i++)
{
if(max>=ss[i])
max=ss[i];
}
printf("%d\n",max);
return 0;
}
```
by 朱胤先 @ 2018-06-18 09:19:04
```cpp
#include<iostream>
using namespace std;
long long minn=100000,nainiu[25];
int n,b;
bool book[25];
void dfs(int nnbh,long long h){
if(h>=b){
if(h-b<minn){
minn=h-b;
}
return;
}
book[nnbh]=1;
for(int i=1;i<=n;i++){
if(book[i]==0){
book[i]=1;
dfs(i,h+nainiu[i]);
book[i]=0;
}
}
book[nnbh]=0;
return;
}
int 呵呵(){
cin>>n>>b;
for(int i=1;i<=n;i++){
cin>>nainiu[i];
}
for(int i=1;i<=n;i++){
dfs(i,nainiu[i]);
}
cout<<minn;
return 0;
}
```
by Ew_Cors @ 2019-07-05 21:19:11