POJ_3627 Bookshelf
2014-10-11 12:43
459 查看
思路: 排序+贪心,,,
# include<cstdio> # include<iostream> # include<algorithm> using namespace std; int cow[20010]; int main(void) { int n;cin>>n; int b;cin>>b; for ( int i = 0;i < n;i++ ) { cin>>cow[i]; } sort(cow,cow+n); int sum = 0; int i = n; while ( sum < b ) { i--; sum+=cow[i]; } cout<<n-i<<endl; return 0; }
相关文章推荐
- POJ 3627:Bookshelf
- POJ 3627 Bookshelf G++
- POJ 3627:Bookshelf
- poj 3627 Bookshelf
- poj 3627 Bookshelf
- poj 3627 Bookshelf(水~)
- POJ 3627 Bookshelf
- [深夜水一水]POJ 3627Bookshelf
- POJ 3627 Bookshelf (贪心)
- (Relax ST1.19)POJ 3627 Bookshelf(贪心)
- POJ 3627 Bookshelf 贪心 水~
- POJ 3627 Bookshelf 贪心 水~
- poj 3628 Bookshelf 2
- 【POJ 3628】Bookshelf 2(01背包)
- poj 3628 Bookshelf 2 01背包!!!
- POJ 3628 Bookshelf 2 题解
- POJ 3628 Bookshelf 2
- POJ 3628 Bookshelf 2 (01背包)
- POJ 3628 Bookshelf 2 G++
- poj 3628 Bookshelf 2