HDOJ--2616--Kill the monster

题目描述：
There is a mountain near yifenfei’s hometown. On the mountain lived a big monster. As a hero in hometown, yifenfei wants to kill it.
Now we know yifenfei have n spells, and the monster have m HP, when HP <= 0 meaning monster be killed. Yifenfei’s spells have different effect if used in different time. now tell you each spells’s effects , expressed (A ,M). A show the spell can cost A HP to monster in the common time. M show that when the monster’s HP <= M, using this spell can get double effect.
输入描述:
The input contains multiple test cases.
Each test case include, first two integers n, m (2<n<10, 1<m<10^7), express how many spells yifenfei has.
Next n line , each line express one spell. (Ai, Mi).(0<Ai,Mi<=m).
输出描述:
For each test case output one integer that how many spells yifenfei should use at least. If yifenfei can not kill the monster output -1.
输入：
3 100
10 20
45 89
5 40

3 100
10 20
45 90
5 40

3 100
10 20
45 84
5 40
输出：
3
2
-1
题意：
在胡萝卜的家乡附近，有着延绵起伏的丛山峻岭。但是在大山的深处，住着一只巨大的怪兽。作为一个家乡的小英雄，胡萝卜决定去消灭怪兽。
现在，胡萝卜有n个技能可以释放（每个技能最多只能释放一次），怪兽的血量为m，当怪兽的血量小于等于0的时候，怪兽就被消灭了。第i种技能有两个参数Ai和Mi，分别表示使用这个技能造成的伤害值，以及当怪兽的血量小于等于Mi的时候，使用这个技能可以产生双倍的伤害。
现在，请你来帮助胡萝卜计算他是否能够杀死怪兽。
题解：
直接DFS，注意怪物血小于Mi的情况
代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 10 + 5;
int n,m,ans;
int vis[maxn];
struct point{
    int x,y;
};

point a[maxn];

void dfs(int blood,int len){
    if(len >= ans) return ;
    if(blood <= 0){
        ans = min(ans,len);
        return ;
    }
    for(int i = 0; i < n; i ++){
        if(vis[i] == 0){
            vis[i] = 1;
            if(blood <= a[i].y) dfs(blood - 2 * a[i].x,len + 1);
            else dfs(blood - a[i].x,len + 1);
            vis[i] = 0;
        }
    }
}


int main(){
    while(scanf("%d%d",&n,&m)!=EOF){
        for(int i = 0; i < n; i ++){
            scanf("%d%d",&a[i].x,&a[i].y);
        }
        memset(vis,0,sizeof(vis));
        ans = 11;
        dfs(m,0);
        if(ans > 10) printf("-1\n");
        else printf("%d\n",ans);
    }
    return 0;
}