codeforce 609A - USB Flash Drives

排序水题

 #include<iostream>
 #include<cstdlib>
 #include<cstdio>
 #include<algorithm>
 #include<math.h>
 using namespace std;

 int n,m;
 int a[];

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