为啥CE

#include<bits/stdc++.h>
using namespace std;
int n,m,num,len;
int a[100],mk[100];
bool cmp(int x,int y)return x>y;
bool dfs(int d,int curlen1,int cursum)
{
	if(cursum>num)return true;
	if(curlen1==len)return dfs(1,0,cursum+1);
	int file =-1;
	for(int i=d;i<=m;i++)
	{
		if(curlen1+a[i]>len || mk[i] ||a[i]==file)continue;
		mk[i]=1;
		if(dfs(i,curlen1+a[i],cursum))return true;
		mk[i]=0;
		file=a[i];
		if(curlen1==0 || curlen1+a[i]==len)return false;
	}
	return false;
}
int main()
{
	cin>>n;
	sum=0;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		sum+=a[i];
	}
	sort(a+1,a+n+1,cmp);
	for(int i=n;i>=1;i--)
	{
		if(sum%i)continue;
		len=sum/i,num=i;
		memset(mk,0,sizeof(mk));
		if(dfs(1,0,1))break;
	}
	cout<<len;
	return 0;
}