装载问题 回溯法解决

我只输出是不是能装得下，没有保存最优解决方案

#include<stdio.h>

#include<string.h>

#define MAXSIZE 50

int heigh[MAXSIZE];

int MAX=0;

int high=0;

int c1,c2;

void loading(int c1,int t,int n);

int main()

{
int n,i,sumheigh=0;
memset(heigh,0,sizeof(heigh));
printf("please enter c1 and c2\n");
scanf("%d%d",&c1,&c2);
printf("please input n\n");
scanf("%d",&n);
printf("please input the value of %d heigh\n",n);
for(i=0;i<n;i++)
{
scanf("%d",&heigh[i]);
sumheigh+=heigh[i];
}
loading(c1,0,n);
if(c2>=(sumheigh-MAX))
printf("you can hold\n");
else
printf("you can't hold\n");
return 0;

}

void loading(int c1,int t,int n)

{
if(t>=n)
{
if(high>MAX)
{
MAX=high;
return ;
}
}
else
{
if(high+heigh[t]<=c1)
{
high+=heigh[t];
loading(c1,t+1,n);
}
else
loading(c1,t+1,n);
}

}