Сортировка слиянием

program perevertish;
uses crt;
var
a:array[1..100] of integer;
b:array[1..100] of integer;
i,j,n,m,s:integer;
begin
writeln('vvedite skolko bydet elementov a(ne bolse 50)');
readln(n);
writeln('vvedite skolko bydet elementov b(ne bolse 50)');
readln(m);
for i:=1 to n do begin
   writeln('vvedite a',i);
   readln(a[i]);
end;
for i:=n+1 to n+m do begin
   writeln('vvedite b',i-n);
   readln(a[i]);
end;
for i:=1 to n+m do begin
   for j:=1 to n+m-1 do begin
     if a[j]>a[j+1] then begin
      s:=a[j+1];
      a[j+1]:=a[j];
      a[j]:=s;
     end;
   end;
end;
writeln('novaja posledovatelnost:');
for i:=1 to n+m do begin
   write(a[i],' ');
 
end;
 
for i:=1 to n do begin
   writeln('vvedite a',i);
   readln(b[i]);
end;
for i:=n+1 to n+m do begin
   writeln('vvedite b',i-n);
   readln(b[i]);
end;
for i:=1 to n+m do begin
   for j:=1 to n+m-1 do begin
     if b[j]>b[j+1] then begin
      s:=b[j+1];
      b[j+1]:=b[j];
      b[j]:=s;
     end;
   end;
end;
writeln('novaja posledovatelnost:');
for i:=1 to n+m do begin
    writeln(b[i], ' ');
end;
readln;
   end.