Сложение двух массивов, сортировка

const
N=3;
var
arr1: array[1..N] of integer;
arr2: array[1..N] of integer;
arr3: array[1..N+N] of integer;
temp:integer;
i,j,k,m: byte;
begin
writeln('1 массив');
for i:=1 to N do
read(arr1[i]);
writeln('2 массив');
for i:= 1 to N do
read(arr2[i]);
i:=1; j:=1; k:=1;
while (i <= N) and (j <= N) do begin
if arr1[i] < arr2[j] then begin
arr3[k] := arr1[i];
i:= i+1
end
else begin
arr3[k] := arr2[j];
j := j+1;
end;
k:= k+1;
end;
while i <= N do begin
arr3[k] := arr1[i];
i := i+ 1;
k:= K+1
end;
while j <= N do begin
arr3[k] :=arr1[j];
j := i+1;
k := k+1
end;
writeln;
for i:= 1 to N+N do
write(arr3[i]:4);
begin
for i:=1 to N do
for j:=1 to N-i do
if arr3[j]>arr3[j+1] then
begin
Temp:=arr3[j];
arr3[j]:=arr3[j+1];
arr3[j+1]:=Temp;
end;
for i:=1 to N do
end;
end.

uses crt;
const n=5;
var a1:array [1..n] of integer;
    a2:array [1..n] of integer;
    a3:array [1..n+n] of integer;
    a4:array [1..n+n] of integer;
    i,j,k,buf: integer;
begin
writeln ('Massiv 1');
for i:=1 to n do
    begin
    a1[i]:=random(21)-10;
    write (a1[i]:3);
    end;
writeln;
writeln ('Massiv 2');
for i:=1 to n do
    begin
    a2[i]:=random(21)-10;
    write (a2[i]:3);
    end;
writeln;
writeln ('Massiv 3');
for i:=1 to n do
    a3[i]:=a1[i];
for i:=n+1 to n+n do
    a3[i]:=a2[i-5];
for i:=1 to n+n do
    write (a3[i]:3);
j:=0;
while j<=n+n do
      begin
      for i:=1 to n+n-1 do
          if a3[i]<a3[i+1] then
             begin
             buf:=a3[i];
             a3[i]:=a3[i+1];
             a3[i+1]:=buf;
             end;
      j:=j+1;
      end;
writeln;
writeln ('Otsortirovannyj massiv');
for i:=1 to n+n do
    write (a3[i]:3);
a4[1]:=a3[1];
j:=2;
begin
      for i:=2 to n+n do
          if a3[i]<>a3[i-1] then
             begin
             a4[j]:=a3[i];
             j:=j+1;
             end;
end;
k:=j-1;
writeln;
writeln ('Ochischenyj massiv');
for i:=1 to k do
    write (a4[i]:3);
end.