第二个点怎么回事求神犇

var n,maxh,sum,ansh,i,j:longint;
       a:array[1..20000] of integer;
procedure qsort(l,r:longint);                    //快排从小到大
var i,j,mid,p:longint;
begin
  i:=l;j:=r;
    mid:=a[(l+n)div 2];
    repeat
        while a[i]<mid do inc(i);
        while a[j]>mid do dec(j);
        if i<=j then
           begin
                p:=a[i];a[i]:=a[j];a[j]:=p;
                inc(i);dec(j);
            end;
    until i>j;
    if l<j then qsort(l,j);
    if i<r then qsort(i,r)
end;
begin
     read(n,maxh);
     for i:=1 to n do read(a[i]);
     qsort(1,n);
     for i:=n downto 1 do
         begin
             if ansh>maxh then break;
             ansh:=ansh+a[i];inc(sum);
         end;
     write(sum);
end.