孙悟空吃蟠桃

def quick_sort(alist, first, last):
    if first >= last:
        return
    mid_value = alist[first]
    low = first
    high = last
    while low < high:
        while low < high and alist[high] >= mid_value:
            high -= 1
        alist[low] = alist[high]
        while low < high and alist[low] < mid_value:
            low += 1
        alist[high] = alist[low]
    alist[low] = mid_value
    # 对low左边的列表执行快速排序
    quick_sort(alist, first, low - 1)
    # 对low右边的列表执行快速排序
    quick_sort(alist, low + 1, last)

if __name__ == "__main__":
    n, p = map(int, input().strip().split())
    # 将耗时少的蟠桃排在前面
    time_consume = list(map(int, input().strip().split()))
    quick_sort(time_consume, 0, n - 1)
    # 模拟吃桃过程
    count = 0
    for i in range(n):
        if n > 0 and p >= time_consume[i]:
            p -= time_consume[i]
            n -= 1
            count += 1
        else:
            # 没时间或者没桃了
            break
    print(count)

import java.util.Scanner; public class 孙悟空吃蟠桃 {  static Long [] nums; public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        Long n = scanner.nextLong();
        Long p = scanner.nextLong();
        Long [] ints = new Long[Math.toIntExact(n)];  for(int i=0;i<n;i++){
            ints[i] = scanner.nextLong();
        }  nums= ints; quickSort(0,nums.length);
            System.out.println(solve(nums,p));
    }  private static void quickSort(int begin, int end) { if(end-begin<2)return; int mid=pivox(begin,end); quickSort(begin,mid); quickSort(mid+1,end);
    } /**  * 将nums[begin,end)范围内的数据进行轴点元素化  * @param begin  * @param end  * @return  */  private static int pivox(int begin, int end) {
        end--;
        Long tmp=nums[begin]; while(begin<end){ while(begin<end){ //先从右到左  if(nums[end]>tmp){
                    end--;
                }else{ nums[begin++]=nums[end]; break;
                }
            } while(begin<end){ if(nums[begin]<=tmp){
                    begin++;
                }else{ nums[end--]=nums[begin]; break;
                }
            }
        } nums[begin]=tmp; return begin;
    } private static long solve(Long[] ints, long p) { long max=0; int total=0; for(int i=0;i<ints.length;i++){
            total+=ints[i]; if(total<p){
                max++;
            }else{ break;
            }
        } return max;
    } /**  * 使用归并排序对数组进行排序  * @param ints  */  private static void mergerSort(int[] ints) { mergerSort(ints,0,ints.length);
    } /**  * 对ints[begin,end)范围内的数据进行归并排序  * @param ints  * @param begin  * @param end  */  private static void mergerSort(int[] ints, int begin, int end) { if(end-begin<2)return; int mid =(begin+end)/2; mergerSort(ints, begin, mid); mergerSort(ints,mid,end); merger(ints,begin,mid,end);
    } /**  * 合并两个[begin,mid)和[mid,end)这两个有序数组  * @param ints  * @param begin  * @param mid  * @param end  */  private static void merger(int[] ints, int begin, int mid, int end) { int[] tmp = new int[end - begin]; for(int i=0,index1=begin,index2=mid;i<tmp.length;i++){ if(index1==mid){
                tmp[i]=ints[index2++];
            }else if(index2==end){
                tmp[i]=ints[index1++];
            }else if(ints[index1]>ints[index2]){
                tmp[i]=ints[index2++];
            }else{
                tmp[i]=ints[index1++];
            }
        } for(int i=begin,j=0;i<end;i++){
            ints[i]=tmp[j++];
        }
    }
}