❶ 贪心的武松 pascal
很简单的题目，快排加贪心。
var a:array[1..maxlongint]of longint;
n,t,i,j,k,ans:longint;
procere qsort(l,r: longint);
var i,j,x,y: longint;
begin
i:=l;j:=r; x:=a[(l+r) div 2];
repeat
while a[i]<x do inc(i);
while x<a[j] do dec(j);
if i<=j then begin
y:=a[i]; a[i]:=a[j]; a[j]:=y; inc(i);dec(j);
end;
until i>j;
if l<j then qsort(l,j);
if i<r then qsort(i,r);
end;
begin
readln(n,t);
for i:=1 to n do read(a[i]);
qsort(1,n); i:=0;
while t>=a[i] do begin
t:=t-a[i];
inc(i);
end;
writeln(i);
end.