TLE了七个点

#include<cstdio>
#include<ctime>
int N,M;
int a[355],b[155],tong[5];
int maxn;
inline int max(int x,int y){return x>y?x:y;}
inline void dfs(int n,int one,int two,int three,int four,int value){
	value+=a[n];
	if((one==0&&two==0&&three==0&&four==0)||n>=N){
		maxn=max(maxn,value);
		return ;
	}
	if(one)dfs(n+1,one-1,two,three,four,value);
	if(two)dfs(n+2,one,two-1,three,four,value);
	if(three)dfs(n+3,one,two,three-1,four,value);
	if(four)dfs(n+4,one,two,three,four-1,value);
	return ;
}
int main(){
	scanf("%d%d",&N,&M);
	for(register int i=1;i<=N;i++)scanf("%d",&a[i]);
	for(register int i=1;i<=M;i++){
		scanf("%d",&b[i]);
		tong[b[i]]++;
	}
//	double t1=clock();
	dfs(1,tong[1],tong[2],tong[3],tong[4],0);
//	double t2=clock();
	printf("%d\n",maxn/*,t2-t1*/);
	return 0;
}