题解 | 吃糖果

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
const int N = 2e5 + 11;
int n;
int k;
int a[N];
int ans = 0;
int main() 
{
    cin >> n >> k;
    for(int i = 1;i <= n;++i)
    {
        cin >> a[i];
    }

    sort(a + 1 , a + 1 + n);

    int temp = 0;
    for(int i = 1;i <= n;++i)
    {
        if(temp + a[i] <= k)
        {
            temp += a[i];
            ans++;
        }
        else {
        break;
        }
    }
    cout << ans << endl;
}
// 64 位输出请用 printf("%lld")