一个简单排序就好了
by namespace @ 2017-08-17 08:43:07
一个冒泡排序搞定
```cpp
var
k,i,j,n,temp:longint;
a:array[1..1000] of longint;
begin
read(n);
for i:=1 to n do
read(a[i]);
for i:=1 to n-1 do
for j:=1 to n-i do
begin
if a[j]>a[j+1] then begin temp:=a[j]; a[j]:=a[j+1]; a[j+1]:=temp; inc(k); end;
end;
write(k);
end.
```
by huangxt @ 2017-08-19 10:44:51