POJ 3627:Bookshelf
2015-07-16 09:19
344 查看
Bookshelf
Description
Farmer John recently bought a bookshelf for cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.
Each of the N cows (1 ≤ N ≤ 20,000) has some height of Hi (1 ≤ Hi ≤ 10,000) and a total height summed across all N cows of S. The bookshelf has a height of B (1 ≤ B ≤ S <
2,000,000,007).
To reach the top of the bookshelf taller than the tallest cow, one or more of the cows can stand on top of each other in a stack, so that their total height is the sum of each of their individual heights. This total height must be no less than the height
of the bookshelf. Since more cows than necessary in the stack can be dangerous, your job is to find the set of cows that produces a stack of the smallest number of cows possible such that the stack can reach the bookshelf.
Input
* Line 1: Two space-separated integers: N and B
* Lines 2..N+1: Line i+1 contains a single integer: Hi
Output
* Line 1: A single integer representing the size of the smallest set of cows that can reach the bookshelf.
Sample Input
Sample Output
大水题,给出一个数的序列,求最小的数量m,使这序列中m个数的和大于等于给定的数。
从大到小排个序。什么时候大于等于给定数值了,就输出即可。
代码:
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 7758 | Accepted: 3906 |
Farmer John recently bought a bookshelf for cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.
Each of the N cows (1 ≤ N ≤ 20,000) has some height of Hi (1 ≤ Hi ≤ 10,000) and a total height summed across all N cows of S. The bookshelf has a height of B (1 ≤ B ≤ S <
2,000,000,007).
To reach the top of the bookshelf taller than the tallest cow, one or more of the cows can stand on top of each other in a stack, so that their total height is the sum of each of their individual heights. This total height must be no less than the height
of the bookshelf. Since more cows than necessary in the stack can be dangerous, your job is to find the set of cows that produces a stack of the smallest number of cows possible such that the stack can reach the bookshelf.
Input
* Line 1: Two space-separated integers: N and B
* Lines 2..N+1: Line i+1 contains a single integer: Hi
Output
* Line 1: A single integer representing the size of the smallest set of cows that can reach the bookshelf.
Sample Input
6 40 6 18 11 13 19 11
Sample Output
3
大水题,给出一个数的序列,求最小的数量m,使这序列中m个数的和大于等于给定的数。
从大到小排个序。什么时候大于等于给定数值了,就输出即可。
代码:
#include <iostream> #include <algorithm> #include <cmath> #include <vector> using namespace std; bool cmp(int a,int b) { return a>b; } int main() { int N,B,i; int height[20005]; cin>>N>>B; for(i=0;i<N;i++) { cin>>height[i]; } sort(height,height+N,cmp); int ans=0; for(i=0;i<N;i++) { ans += height[i]; if(ans>=B) { cout<<i+1<<endl; return 0; } } return 0; }
相关文章推荐
- 在iOS中创建多线程都有哪些方法?
- CAP理论
- FPGA实现网络通信时的网络字节序问题
- 高仿网易4.0新UI框架
- vxworks tornado 调试技巧
- Oracle数据字典
- [Tjoi2013][BZOJ3172] 单词
- iOS跳转到另一个程序
- python 搭建环境
- github/gitlab 管理多个ssh key
- ios 屏幕方向控制
- java常用的7大排序算法汇总
- 矩阵求导公式
- android 仿EF看视频弹出练习功能
- eclipse 高亮设置内容
- Github的简单使用方法
- Spring常见注解的使用
- [转]微架构设计:微博计数器的设计
- GraphX:基于Spark的弹性分布式图计算系统
- Uboot与Linux Kernel参数传递