问一道Free Pascal的题目。

Var
i,max,id,temp:longint;
k:array[1..10000]of longint;
Begin
read(n);
for i:=1 to n do
read(k[i]);{读入

id:=n;
max:=maxlongint;{初始化设置}

For i:=n downto 1 do
if k[i] begin
max:=k[i];
id:=i;
end;{寻找最小的靠左的数}

temp:=k[id];
k[id]:=k[1];
k[1]:=temp;{替换位置}

for i:=1 to n do
write(k[i],' ');{输出}
end.

n的大小？

赋maxlongint,一个for循环扫一遍，swap,输出

var n,i,j,t:integer;
a:array[1..32767]of integer;
f:boolean;
begin
readln(n);
for i:=1 to n do
read(a[i]);
for i:=1 to n do
begin
f:=true;
for j:=1 to n do
if a[i]>a[j] then
f:=false;
if f then
begin
t:=a[i];
a[i]:=a[1];
a[1]:=t;
for j:=1 to n do
write(a[j],' ');
readln;
halt
end
end
end.