Find the smallest positive element in a one-dimensional array.

program zz1;
const n = 14; // set the number of elements in the array
var i, min, k: integer; // set variables of integer type
m: array [1..n] of integer;
begin
for i: = 1 to n do // write numbers in the array at random
m [i]: = random (21) -10;
for i: = 1 to n do // display the array on the screen
write (m [i], ”);
writeln; // go to a new line to display the response
min: = 100000;
for i: = 1 to n do // find the maximum element and its number
if m [i]> 0 then if m [i] <min then min: = m [i];
writeln (‘smallest positive element =’, min); // display the answer
end.