program t implicit none integer::N,M integer,allocatable,dimension(:)::C integer::i read*,N,M allocate(C(N)) read*,C call heapsort(N,C) do i=1,N if(M<C(i))then print"(i0)",I-1 stop else M=M-C(i) endif end do print"(i0)",N contains subroutine heapsort(n,array) implicit none !ここの入力は状況に応じて変更すること integer,intent(in) :: n integer,intent(inout) :: array(1:n) integer::i,k,j,l integer:: t l=n/2+1 k=n do while(k /= 1) if(l > 1)then l=l-1 t=array(L) else t=array(k) array(k)=array(1) k=k-1 if(k == 1) then array(1)=t exit endif endif i=l j=l+l do while(j<=k) if(j < k)then if(array(j) < array(j+1))j=j+1 endif if (t < array(j))then array(i)=array(j) i=j j=j+j else j=k+1 endif enddo array(i)=t enddo return end subroutine heapsort end program t