Repair the Wall(贪心 区间覆盖)
2016-07-10 17:15
337 查看
Repair the Wall
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit
Status
Description
Long time ago , Kitty lived in a small village. The air was fresh and the scenery was very beautiful. The only thing that troubled her is the typhoon.
When the typhoon came, everything is terrible. It kept blowing and raining for a long time. And what made the situation worse was that all of Kitty’s walls were made of wood.
One day, Kitty found that there was a crack in the wall. The shape of the crack is
a rectangle with the size of 1×L (in inch). Luckly Kitty got N blocks and a saw(锯子) from her neighbors.
The shape of the blocks were rectangle too, and the width of all blocks were 1 inch. So, with the help of saw, Kitty could cut down some of the blocks(of course she could use it directly without cutting) and put them in the crack, and the wall may be repaired perfectly, without any gap.
Now, Kitty knew the size of each blocks, and wanted to use as fewer as possible of the blocks to repair the wall, could you help her ?
Input
The problem contains many test cases, please process to the end of file( EOF ).
Each test case contains two lines.
In the first line, there are two integers L(0
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit
Status
Description
Long time ago , Kitty lived in a small village. The air was fresh and the scenery was very beautiful. The only thing that troubled her is the typhoon.
When the typhoon came, everything is terrible. It kept blowing and raining for a long time. And what made the situation worse was that all of Kitty’s walls were made of wood.
One day, Kitty found that there was a crack in the wall. The shape of the crack is
a rectangle with the size of 1×L (in inch). Luckly Kitty got N blocks and a saw(锯子) from her neighbors.
The shape of the blocks were rectangle too, and the width of all blocks were 1 inch. So, with the help of saw, Kitty could cut down some of the blocks(of course she could use it directly without cutting) and put them in the crack, and the wall may be repaired perfectly, without any gap.
Now, Kitty knew the size of each blocks, and wanted to use as fewer as possible of the blocks to repair the wall, could you help her ?
Input
The problem contains many test cases, please process to the end of file( EOF ).
Each test case contains two lines.
In the first line, there are two integers L(0
#include<stdio.h> #include<iostream> #include<algorithm> #include<string.h> #include<math.h> #include<queue> using namespace std; const int maxn=605; int main() { int L,N; while(scanf("%d%d",&L,&N)!=EOF) { int num[maxn]; for(int i=0;i<N;i++) scanf("%d",&num[i]); sort(num,num+N); int result=0; for(int i=N-1;i>=0&&L>0;i--) { L-=num[i]; result++; } L>0?printf("impossible\n"):printf("%d\n",result); } return 0; }
相关文章推荐
- 在用hadoop fs -ls 时报failed onconnetion的错误
- LeetCode 373 Find K Pairs with Smallest Sums
- 出现ping:unknow host www.baidu.com的问题解决
- leetcode 217. Contains Duplicat hash解法及相关hashmap与hashset问题
- blockchain名词解析
- find-k-pairs-with-smallest-sums
- INSTALL_FAILED_UPDATE_INCOMPATIBLE
- RAID 方案总结
- Mahout Naive Bayes中文新闻分类示例
- AAL template: ROI to brain lobe
- HDU5405 Sometimes Naive
- http://jingyan.baidu.com/album/03b2f78c4cc0ad5ea337ae7d.html
- Find K Pairs with Smallest Sums
- HDU 5009 Paint Pearls 双向链表优化DP
- rails学习资源
- IBM与法国银行合作,率先使用区块链技术管理客户身份并提高客户满意度
- Irrlicht学习笔记(11)--TerrainRender
- 微软为何要豪赌AI?纳德拉想让公司超越谷歌
- 关于“post-commit hook failed (exit code 255) with no output.”的解决方法
- Codeforces Round #360 (Div. 2) D. Remainders Game 中国剩余定理