f

xa1.pas

program zadatak2;
type niz = array[1..1000] of integer;
var
  x, y: niz;
  i, j, minI, n: integer;
  minS, s: real;

function dist(x0, y0, x1, y1: integer): real;
begin
  dist := sqrt((x0-x1)*(x0-x1)+(y0-y1)*(y0-y1));
end;

{ Hvala Tina! }
procedure unos (n:integer;var x: niz; c: char);
var i:integer;
begin
  for i:=1 to n do begin
     write(c, '[',i,']= ');
     readln(x[i]);
  end;
end;

begin
  write('n=');
  readLn(n);
  unos(n, x, 'x');
  unos(n, y, 'y');

  minS := MaxInt;
  for i := 1 to n do begin
    s := 0.0;
    for j := 1 to n do begin
      if (not(i=j)) then begin
         s := s + dist(x[i], y[i], x[j], y[j]);
      end;
    end;
    if(minS > s) then begin
       minS := s;
       minI := i;
    end;
  end;

  writeLn('========');
  writeLn('INDEX: ', minI);
  writeLn('SUM:   ', minS:0:4);
  readLn();
end.