pascal大虾过来一下！

Program Huff;
const
n=4;
m=n*2-1;
type
tree=record
ch:char;
w:integer;
lc,rc,par:0..m;
end;
list=record
byte:array[1..n] of integer;
loc:integer;
ch:char;
end;
var
forest:array[1..n] of tree;
tab:array[1..n] of list;
small1,small2,p1,p2:integer;
chd:char;
grch:array['A'..'Z'] of integer;
i,j:integer;
f1,f2:text;
procedure buildtree;
var
i,j:integer;
begin
for i:=1 to m do
begin
with forest[i] do
begin
lc:=0;rc:=0;par:=0;
end;
end;
for i:=n+1 to m do
begin
small1:=0;small2:=0;p1:=0;p2:=0;
for j:=1 to i-1 do
begin
if forest[j].par=0 then
if forest[j].w<small1 then
begin
small2:=small1;small1:=forest[j].w;p2:=p1;p1:=j;
end
else if forest[j].w<small2 then
begin
small2:=f

有车模大虾过来一下 大虾们过来看一下啊，先谢了 新机问题！～～大虾过来帮忙看一下啊！～～～急 pascal大虾快进急急急急 各位大虾请过来！！ 大虾们.过来看看 各位大虾过来看看 大虾过来帮帮忙，OK? 大虾过来帮忙下 各位大虾，过来看看？