TYVJ 1340

【题目分析】
    分成两部分暴力搜索，排序+二分查找+卡时间。
   

---

【代码】

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int a[45];
int so[10000000],top=0;
long long ans=0;
long long w;
int n;
int fuck=0;
inline void dfs(long long now,int step,int dep)
{
    if (now>w) return;
    if (step>dep) {so[++top]=now;return;}
    dfs(now+a[step],step+1,dep);
    dfs(now,step+1,dep);
}
inline void dfs2(long long now,int step,int dep)
{
    if (now>w) return ;
    if (step>dep)
    {
        int l=1,r=top;
        while (l<r)
        {
            fuck++;
            int mid=(l+r)/2+1;
            if ((long long)now+so[mid]>w) r=mid-1;
            else l=mid;
            if (fuck>50000000) {printf("%lld\n",ans);exit(0);}
        }
        long long tmp=(long long)now+so[l];
        if (tmp>w||tmp<0) return ;
//      cout<<tmp<<endl;
//      getchar();
        ans=max(ans,tmp);
        return;
    }
    dfs2(now+a[step],step+1,dep);
    dfs2(now,step+1,dep);
}
int main()
{
    scanf("%lld%d",&w,&n);
    for (int i=1;i<=n;++i) scanf("%d",&a[i]);
    dfs(0,1,n/2);
    sort(so+1,so+top+1);
//  cout<<"ha"<<endl;
    dfs2(0,n/2+1,n);
    cout<<ans<<endl;
    return 0;
}