Ответ: var a,i,j,b,p,p1:longint;m:array[0..501] of longint;procedure qsort(l,r:longint);var q,w,i,j,p:longint;beginq:=m[(l+r) div 2];repeatwhile m[i]<q do inc(i);while m[j]>q do dec(j);if i<j thenbeginw:=m[i];m[i]:=m[j];m[j]:=w;inc(i); dec(j);inc(p);end;if i=j thenbegininc(i);dec(j);end;until i>j;if i<r then qsort(i,r);if j<l then qsort(l,j);p1:=p;end;beginfor i:=1 to 500 dom[i]:=random(100);for i:=1 to 500 dofor j:=500 downto i+1 doif m[j]<m[i] thenbegin  a:=m[j];  m[j]:=m[i];  m[i]:=a; inc(p);end;writeln(p);qsort(1,500);writeln(p1);end.