Description：

Solution：

Code：

#include<algorithm>

#include<iostream>

#include<cstdlib>

#include<cstdio>

#include<cmath>

#include<cstring>

using namespace std;

int n,m;

#define MAXN 100010

#define MAXM 17

int val[MAXM],p[MAXN],s[MAXN];

int f[1 << MAXM];

int main()

{

	scanf("%d%d",&m,&n);

	for(int i = 1;i <= m;++i)scanf("%d",&val[i]);

	for(int i = 1;i <= n;++i)scanf("%d",&p[i]);

	for(int i = 1;i <= n;++i)s[i] = s[i - 1] + p[i];

	s[++n] = 0x3f3f3f3f;

	int tot = (1 << m) - 1;

	memset(f,0,sizeof(f));

	int ans = -1;

	for(int b = tot;b >= 0;--b)

	{

		int res = 0;

		for(int i = 1;i <= m;++i)

		{

			if(b & (1 << (i - 1)))

			{

				int p = upper_bound(s,s + 1 + n,s[f[b]] + val[i]) - s - 1;

				f[b ^ (1 << (i - 1))] = max(f[b ^ (1 << (i - 1))],p);

				res += val[i];

			}

		}

		if(f[b] == n - 1)ans = max(ans,res);;

	}

	cout << ans << endl;

	return 0;

}