记录编号	124330	评测结果	AAAAAAAAAAAAA
题目名称	[USACO Nov13] 不设找零	最终得分	100
用户昵称	HouJikan	是否通过	通过
代码语言	C++	运行时间	0.753 s
提交时间	2014-10-03 10:46:54	内存使用	1.23 MiB

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <list>
#include <vector>
#include <ctime>
#include <iterator>
#include <functional>
#define pritnf printf
#define scafn scanf
#define For(i,j,k) for(int i=(j);i<=(k);(i)++)
using namespace std;
typedef long long LL;
typedef unsigned int Uint; 
const int INF=0x7ffffff;
//==============struct declaration==============

//==============var declaration=================
const int MAXN=100010;
int coins[20],n,k;
LL S[MAXN];
int f[80000];
bool inq[80000];
//==============function declaration============
bool cmp(LL a,LL b){return a>b;}
//==============main code=======================
int main()
{  
  string FileName="nochange";//程序名 
  string FloderName="COGS";//文件夹名 
  freopen((FileName+".in").c_str(),"r",stdin);
  freopen((FileName+".out").c_str(),"w",stdout);
  ios::sync_with_stdio(false);
  scanf("%d%d",&k,&n);
  For(i,0,k-1)
    scanf("%d",&coins[i]);
  sort(coins,coins+k,cmp);
  memset(S,0,sizeof(S));
  For(i,1,n){
    scanf("%d",&S[i]);
    S[i]+=S[i-1];
  }
  memset(f,0,sizeof(f));
  queue <int> Q;Q.push((1<<k)-1);
  while (!Q.empty()){
    int x=Q.front();Q.pop();
    inq[x]=false;
    int pre=0;
    For(p,0,k-1){
      if ((x&(1<<p))==0) continue;
      int j;
      if (S[f[x^(1<<p)]]-S[f[x]]>coins[p]) continue;
      for(j=max(f[x],f[x^(1<<p)]+1);S[j]-S[f[x]]<=coins[p]&&j<=n;j++);
      if (f[x^(1<<p)]<j){
        f[x^(1<<p)]=j-1;
        if (!inq[x^(1<<p)])
          Q.push(x^(1<<p));
        inq[x^(1<<p)]=true;
      }
    }
  }
  LL ans=-1;
  For(i,0,(1<<k)-1){
    if (f[i]!=n) continue;
    LL cnt=0;
    For(p,0,k-1)
      if (i&(1<<p))
        cnt+=coins[p];
    ans=max(ans,cnt);
  }
  printf("%lld\n",ans);
  return 0;
}
//================fuction code====================