Program sort;
Var
B: array[1..10] of integer;
N, I, j, k: byte;
Min,max: integer;
Begin
Write(‘Введите количество элементов массива’);
Read (n);
For i: =1 to n do
begin
Write(‘B[‘, i,’]=’);
Read (B[i]);
end;
For I:=1 to n/2-1 do  Begin
k:=I; min:=b[I];
For j:=I+1 to n/2 do
If b[j]<min then
Begin k:=j; min:=b[j];
end;
b[k]:=b[I]; b[I]:=min;
End;
For x:=1 to n/2-1 do  Begin
y:=I; max:=b[x];
For c:=x+1 to n/2 do
If b[c]<max then
Begin p:=c; min:=b[c];
end;
b[p]:=b[x]; b[x]:=max;
End;
For i: =1 to n do
Writeln ( b[i]:5);
Writeln ( b[x]:5);
Writeln;
End.