hdu 2616 Kill the monster（DFS）

题目链接：hdu2616

暴力求解

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<queue>
using namespace std;
int a[15],b[15],v[15];
int limit,n,ans,flag;
void dfs(int blood,int cur)
{
if(blood <= 0)
{
ans = min(ans,cur);
flag = 1;
return;
}
for(int i = 0 ; i < n ; i ++)
{
if(!v[i])
{
v[i] = 1;
if(blood <= b[i])
dfs(blood - 2*a[i],cur + 1);
else
dfs(blood - a[i],cur + 1);
v[i] = 0;
}
}
}
int main()
{
//freopen("in.txt","r",stdin);
while(~scanf("%d%d",&n,&limit))
{
for(int i = 0 ; i < n ; i ++)
scanf("%d%d",&a[i],&b[i]);
memset(v,0,sizeof(v));
ans = 10000;
flag = 0;
dfs(limit,0);
if(flag) printf("%d\n",ans);
else printf("-1\n");
}
return 0;
}