POJ Bookshelf 2(DFS)

最新推荐文章于 2020-09-17 08:39:35 发布

weixin_30642029

最新推荐文章于 2020-09-17 08:39:35 发布

阅读量85

点赞数

原文链接：http://www.cnblogs.com/372465774y/archive/2012/08/06/2624536.html

版权

Bookshelf 2

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5109		Accepted: 2350

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 H_i (1 ≤ H_i ≤ 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: H_i

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

Sample Output

Source

USACO 2007 December Bronze

//这题和上次ZOJ月赛的一题差不多，我都是用收索过的
//因为N比较小
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
int a[22];
int N,B,Min;
bool cmp(const int&a,const int &b)
{
    return a>b;
}
void dfs(int k,int sum)
{
   if(Min==0) return;//加了这句就0Ms，不然就16Ms
    if(sum>=B)
    {
        Min=min(Min,sum-B);
        return ;
    }
    int i,s=0;
    for(i=k;i<N;i++)
      s+=a[i];
    if(sum+s<B) return;
    dfs(k+1,sum+a[k]);
    dfs(k+1,sum);
}
int main()
{
    int i;
    while(scanf("%d%d",&N,&B)!=EOF)
    {
      Min=B;
      for(i=0;i<N;i++)
       scanf("%d",&a[i]);
      sort(a,a+N,cmp);
      dfs(0,0);
      printf("%d\n",Min);
    }
    return 0;
}