POJ 3627 Bookshelf (贪心)
来源:互联网 发布:手机淘宝免费注册账号 编辑:程序博客网 时间:2024/06/06 14:09
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
6 40
6
18
11
13
19
11
Sample Output
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
解析: (水水更健康)
问题:已知有n个人及每个人的身高,问为了达到高度b,最少需要几个人叠罗汉。保证n个人的总身高超过b。
思路:先取身高最高的,如果不足b,再取剩下中最高的。先排序,再贪心。
代码:
#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include <set>#include <climits>#include <cmath>#include <algorithm>#define MAXN 50010#define RST(N)memset(N, 0, sizeof(N))using namespace std;int a[MAXN], n, m;int cmp(const void *a, const void *b){ return *(int *)a - *(int *)b;}int main(){ while(~scanf("%d %d", &n, &m)) { for(int i=0; i<n; i++) scanf("%d", &a[i]); qsort(a, n, sizeof(int), cmp); for(int i=n-1; i>=0; i--) { m -= a[i]; if(m <= 0) { printf("%d\n", n-i); break; } } } return 0;}
0 0
- POJ 3627 Bookshelf (贪心)
- POJ 3627 Bookshelf 贪心 水~
- (Relax ST1.19)POJ 3627 Bookshelf(贪心)
- poj 3627 Bookshelf(水~)
- poj 3627 Bookshelf
- POJ 3627:Bookshelf
- POJ 3627 Bookshelf G++
- [深夜水一水]POJ 3627Bookshelf
- POJ 3628 Bookshelf 2 (01背包)
- poj 3628 Bookshelf 2 (01背包)
- 【POJ 3628】Bookshelf 2(01背包)
- POJ 3628 Bookshelf 2(简单背包)
- POJ 3628 Bookshelf 2 (01背包)
- POJ 3628 - Bookshelf 2
- POJ 3628 - Bookshelf 2
- POJ 3628 Bookshelf 2
- poj-3628-Bookshelf 2
- poj 3628 Bookshelf 2
- IOS调试技巧:当程序崩溃的时候怎么办 iphone IOS
- Activity的生命周期(四)
- 0011 嘿嘿
- 链表 Remove Duplicates from Sorted List
- Xcode常用插件和开发实用工具
- POJ 3627 Bookshelf (贪心)
- FKJAVA读书笔记--第九章--泛型(修改)
- ObjectC----实现简单的通讯录(增删改查)
- 对Xposed的全面分析(一)--- xposedInstall apk文件,逆向分析
- iOS基础UIView
- IOS成长之路-使用xib界面与和代码相关联的方法
- ArcGIS Desktop 启动编辑(start editing) "Not Register As Versioned"错误
- 构造无穷个无穷小量,使它们的乘积为常数
- 虚函数,虚析构函数,虚函数表