TLE on #30 ，谁能帮我卡掉最后3ms?

#include <bits/stdc++.h>
using namespace std;

const int N = 100;
int t[N], n, maxi, mini, sum;

void dfs(int rst, int s, int ans, int p){
	if(rst == 0){
		printf("%d", ans);
		exit(0);
	}
	if(s == ans){
		dfs(rst - 1, 0, ans, maxi);
		return;
	}
	for(int i = p; i >= mini; i --){
		if(!t[i]) continue;
		if(i + s > ans) continue;
		t[i] --;
		dfs(rst, s + i, ans, i);
		t[i] ++;
		if(s == 0 || s + i == ans) break; 
	}
	return;
}

int main(){
	scanf("%d", &n);
	mini = N;
	int x = 0;
	while(n --){
		scanf("%d", &x);
		t[x] ++;
		maxi = max(maxi, x);
		mini = min(mini, x);
		sum += x;
	}
	for(int i0 = maxi; i0 <= sum / 2; i0 ++){
		if(sum % i0 == 0) dfs(sum / i0, 0, i0, maxi);
	}
    printf("%d", sum);
}