pascal语言,用回溯（深搜）做装箱问题,就是01背包

program kas;var a:array[1。。10000] of integer; n,m,i,min:integer;procedure go(i,sum:integer);begin if sum>m then exit; if min>m-sum then min:=m-sum; if i=n+1 then exit; go(i+1,sum+a[i]); go(i+1,sum);end;begin readln(n,m); for i := 1 to n do read(a[i]); min:=maxint; go(1,0); writeln(min);end。 给我加分!