OJ Board

var p,pi,t,len,n,w,i,tot:longint;
l,r:array[0..10000]of double;
now,max:double;
flag:boolean;
procedure qsort(x,y:longint);
var i,j:longint;
k,temp:double;
begin
i:=x;j:=y;k:=l[(i+j) div 2];
repeat
while l[i]<k do inc(i);
while l[j]>k do dec(j);
if not (i>j) then begin
temp:=l[i];l[i ...