车厢重组 程序

• var  n,i,t,k,j:longint;
       a:array[0..10000]of longint;
  begin
    readln(n);
    for i:=1 to n do read(a[i]);
    for j:=1 to n do
      for i:=1 to n-j do
        if a[i]>a[i+1] then
          begin
            a[0]:=a[i];
            a[i]:=a[i+1];
            a[i+1]:=a[0];
            inc(k);
          end;
    write(k);
  end.