hdu5887 大01背包--dfs

Herbs Gathering

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 548    Accepted Submission(s): 104

Problem Description

Collecting one's own plants for use as herbal medicines is perhaps one of the most self-empowering things a person can do, as it implies that they have taken the time and effort to learn about the uses and virtues of the plant and how it might benefit them, how to identify it in its native habitat or how to cultivate it in a garden, and how to prepare it as medicine. It also implies that a person has chosen to take responsibility for their own health and well being, rather than entirely surrender that faculty to another. Consider several different herbs. Each of them has a certain time which needs to be gathered, to be prepared and to be processed. Meanwhile a detailed analysis presents scores as evaluations of each herbs. Our time is running out. The only goal is to maximize the sum of scores for herbs which we can get within a limited time.

 

Input

There are at most ten test cases.
For each case, the first line consists two integers, the total number of different herbs and the time limit.
The  i -th line of the following  n  line consists two non-negative integers. The first one is the time we need to gather and prepare the  i -th herb, and the second one is its score.

The total number of different herbs should be no more than  100 . All of the other numbers read in are uniform random and should not be more than  109 .

 

Output

For each test case, output an integer as the maximum sum of scores.

 

Sample Input

  
  

   
   3 70
71 100
69 1
1 2
  
  

 

Sample Output

  
  

   
   3
  
  

 

Source

2016 ACM/ICPC Asia Regional Qingdao Online

采药,之前做过的采药，V很小，可以用动态规划来做，今天的采药V达到了10^9,必须用搜索加上剪枝来做，按照贪心思想，按照v/w 由大到小排序，然后进行搜索，搜索之前把大于W的选项都删除，在搜索过程中，进行剪枝，判断带上第i项能否比当前最大值大，大就加上第i项否则不加