(Relax ST1.19)POJ 3627 Bookshelf(贪心)

/*
* POJ_3627.cpp
*
*  Created on: 2013年11月26日
*      Author: Administrator
*/

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

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

bool cmp(int a,int b){
return a>b;
}

int main(){
int n,b;
while(scanf("%d%d",&n,&b)!=EOF){
int i;
for(i = 0 ; i < n ; ++i){
scanf("%d",&a[i]);
}

sort(a,a+n,cmp);

int count = 0;
int sum = 0;
for(i = 0 ; i < n ; ++i){
sum += a[i];
count++;

if(sum >= b){
break;
}

}

printf("%d\n",count);
}

return 0;
}