Найти минимальный элемент в одномерном массиве — Pascal(Паскаль)

program maxsum;
 
{$APPTYPE CONSOLE}
 
uses
  SysUtils;
 
const n = 10;
 
  var
    massive: array [0..n-1] of integer;
 
    mSum, i, j, min, a, b: integer;
 
begin
  mSum := 0;
  Randomize;
  writeln('Vvedite chisla dlya zadania intervala dlya zapolnenia matrici');
  write('Vvedite a: ');
  readln(a);
  writeln;
  write('Vvedite b: ');
  readln(b);
  writeln;
  writeln('massive generated... Done!');
  for i := 0 to n - 1 do 
        massive[i] := Random(b - a + 1) + a;
  for i := 0 to n - 1 do  
     write(massive[i]:3);
 
  writeln;
  writeln('Push any key for computing');
  readln;
  min := 0;
  for i := 0 to n - 1 do
    if massive[i] < massive[min] then min := i;
 
  writeln('Min element ', massive[min]);
 
  readln;
end.