算法设计与分析-程序存储问题

#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

bool run()
{
    int n,l;
    if(!(cin>>n>>l))  return false;
    vector<int> f(n);
    for(int i=0; i<n; i++)
    {
        cin>>f[i];
    }
    sort(f.begin(),f.end());
    int cnt=0;
    for(int i=0; i<n; i++)
    {
        if(l-f[i]>=0)
        {
            cnt++;
            l=l-f[i];
        }
        else
        {
            break;
        }
    }
    cout<<cnt<<endl;