0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2025-01-23 11:51:58 +00:00

P2676 [USACO07DEC] Bookshelf B

R38819026
This commit is contained in:
Baoshuo Ren 2020-09-24 18:47:06 +08:00 committed by Baoshuo Ren
parent 40e26e2bf5
commit 07db60b85e
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68

19
problem/P2676/P2676.cpp Normal file
View File

@ -0,0 +1,19 @@
// R38819026
#include<bits/stdc++.h>
using namespace std;
int main() {
int n, h[20005], b, sum=0, i;
cin >> n >> b;
for(i = 0 ; i < n ; i++) {
cin >> h[i];
}
sort(h, h+n);
while(sum < b) {
sum += h[--i];
}
cout << n-i << endl;
return 0;
}