CodeForces 609A USB Flash Drives

水题

#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;

const int maxn=+;
int a[maxn];

int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=; i<=n; i++) scanf("%d",&a[i]);
        sort(a+,a++n);
        int ans=;
        for(int i=n; i>=; i--)
        {
            ans++;
            m=m-a[i];
            if(m<=) break;
        }
        printf("%d\n",ans);
    }
    return ;
}