P1825 东方香霖堂

发布时间 2023-05-25 12:25:54作者: 刘海烽
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    int n, k;
    cin >> n >> k;
    int a[n];
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(a, a + n);
    int cnt = 0;
    for (int i = 0; i < n; i++) {
        if (a[i] <= k) {
            cnt += 1;
            k -= a[i];
        } else {
            break;
        }
    }
    cout << cnt << endl;
    return 0;
}