# poj-3628

Bookshelf 2
 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6865 Accepted: 3166

Description

Farmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.

FJ has N cows (1 ≤ N ≤ 20) each with some height of Hi (1 ≤ Hi ≤ 1,000,000 - these are very tall cows). The bookshelf has a height of B (1 ≤ B ≤ S, where S is the sum of the heights of all cows).

To reach the top of the bookshelf, 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 in order for the cows to reach the top.

Since a taller stack of cows than necessary can be dangerous, your job is to find the set of cows that produces a stack of the smallest height possible such that the stack can reach the bookshelf. Your program should print the minimal 'excess' height between the optimal stack of cows and 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 (non-negative) difference between the total height of the optimal set of cows and the height of the shelf.

Sample Input

5 16
3
1
3
5
6

Sample Output

1

Source

01背包
#include <iostream>
#define maxv 1000005
using namespace std;
int ans[maxv],n,v,c[21],sum;
int main()
{
cin>>n>>v;
for(int i=1; i<=n; i++){
cin>>c[i];
sum += c[i];
}

for(int i=1; i<=n; i++){
for(int j=sum; j>=c[i]; j--){
if(ans[j]<ans[j-c[i]]+c[i])
ans[j]=ans[j-c[i]]+c[i];
}
}

for(int i=v; i<=sum; i++){
if(i==ans[i]){
cout<<ans[i]-v<<endl;
break;
}
}
return 0;
}


DFS，别人写的，没看懂。
/* Author : yan
* Question : POJ 3628 Bookshelf 2
* Data && Time : Wednesday, December 22 2010 11:34 PM
*/
#include<stdio.h>
using namespace std;
int cow[20];
int b;
int n;
int ans=99999999;
void DFS(int num,int sum)
{
if(sum>=ans) return;
if(num==n)
{
if(sum>=b) ans=sum;
return;
}
DFS(num+1,sum);
DFS(num+1,sum+cow[num]);
}
int main()
{
//freopen("input","r",stdin);
int i,j,cnt,tmp;
int sum;
scanf("%d %d",&n,&b);
for(i=0;i<n;i++)
scanf("%d",&cow[i]);
DFS(0,0);
printf("%d",ans-b);
return 0;
}


#### poj3628 Bookshelf 2（0/背包）

2012-09-23 11:07:35

#### poj3628-DFS/0-1背包-DP/枚举-数据比较弱、方法比较多

2012-10-31 23:58:20

#### poj-3628 Silver Cow Party

2015-01-28 22:57:27