Написать функцию которая возвращает True, если есть пара чисел, которая удовлетворяет условие

arr : array[1..1000] of Integer;

arr[i] + arr[j] = 0;

function prot(arr:mas):boolean;
 var i,j:integer;
     f:boolean;
 begin
  i:=1;
  f:=false;
  while (not f)and(i<=n) do 
   begin
    j:=i+1;
    while (not f)and(j<=n) do
     begin
      if arr[i] + arr[j] = 0 then f:=true;
      inc(j)
     end;
    inc(i)
   end;
  prot:=f
 end;

if arr[i] + arr[j] = 0 then f:=true;

function prot(const a: array of Integer): Boolean;
var i, j: Integer;
begin
  prot:=True;
  for i:=Low(a) to High(a) do
    for j:=i+1 to High(a) do
      if a[i]=-a[j] then Exit;
  prot:=False;
end;

const r1=-32768; r2=32767;
type TSmallInt = r1..r2;
function Test(const a: array of TSmallInt): Boolean:
type TInts = array [TSmallInt] of Integer;
var
  b: ^TInts;
  i, j: Integer; k: Longint;
begin
  New(b); FillChar(b^,SizeOf(b^),#0);
  for k:=Low(a) to High(a) do Inc(b^[a[k]]);
  i:=r2; j:=-r2;
  while (i<j) and not ((b^[i]=1) and (b^[j]=1)) do begin Inc(i); Dec(j); end;
  Dispose(b);
  Test:=i<j;
end;

const r1=-32768; r2=32767;
type TSmallInt = r1..r2;
function Test(const a: array of TSmallInt): Boolean:
type TInts = array [SmallInt] of Byte;
var
  b: ^TInts;
  i, j: SmallInt; k: Longint;
begin
  New(b); FillChar(b^,SizeOf(b^),#0);
  for k:=Low(a) to High(a) do b^[a[k]]:=1;
  i:=-r2; j:=r2;
  while (i<j) and (b^[i]+b^[j]<>2) do begin Inc(i); Dec(j); end;
  Dispose(b);
  Test:=i<j;
end;

type TInts = packed array [-32768..32767] of Boolean;
...
... b^[a[k]]:=True;
while (i<j) and b^[i] and b^[j] do ...

const r1=-32768; r2=32767;
type TSmallInt = r1..r2;
function Test(const a: array of TSmallInt): Boolean:
var
  b: packed array [TSmallInt] of Boolean;
  i, j: SmallInt; k: Longint;
begin
  FillChar(b,SizeOf(b),#0);
  for k:=Low(a) to High(a) do b[a[k]]:=True;
  i:=-r2; j:=r2;
  while (i<j) and not (b[i] and b[j]) do begin Inc(i); Dec(j); end;
  Test:=i<j;
end;