if L[MaxSize] < Mi: then Min "= L[MaxSize] end { MinMax }; procedure ReadWrite(var: List); begin for Item : = 1 to MaxSi:,' do begin Read(Input, L[item]); Write (Output, L[Item :4) end; Writeln(Output) end { ReadWrite }; begin {main program ReadWrite (A) ; MinMax(A, MinA, MaxA); Writeln (Output, MinA, Ma> !." MaxA - MinA); Writeln(Output); ReadWrite (B) ; MinMax(B, MinB, MaxB); Writeln(Output, MinB, Max~, MaxB - MinB); Writeln(Output); Writeln(Output); Writeln(Output, abs(MinA Writeln(Output); MinB), abs(MaxA - MaxB»; for Item := 1 to MaxSize do begin A[Item] := A[Item] + B[ :tem]; Write (Output, A[Item] : .1) end; Writeln(Output); MinMax(A, MinA, MaxA) ; Writeln(Output, MinA, Max,\, MaxA - MinA) end " 

## Produces as results (assuming appropriate input): 

-1 -3 4 7 8 54 2 -s 3 9 9 9 -6 45 79 79 3 1 1 5 -6 79 ~ ~) 45 43 3 8 1 34 4 34 3 8 -1 3 -2 -4 6 6 6 7 -8 45 ~ 3 2 34 44 40 7 15 9 88 1 -4 7 43 12 17 -7 48 77 75 9 7 7 12 -7 88 9S 

