ZOJ 2297 Survival (状态dp)

struct Node
{
int cost;
int rec;
Node(){}
}node[22];

int n;
int dp[1<<20];
int  main(){
while(cin >> n)
{
n--;
int i , j , boss;
for(i = 0;i < n;i++) scanf("%d%d",&node[i].cost,&node[i].rec);
scanf("%d",&boss);
memset(dp , -1 , sizeof(dp));
dp[0] = 100;
for(i = 0;i < (1<<n);i++)
{
if(dp[i] < 0) continue;
for(j = 0;j < n;j++)
{
if(i&(1<<j)) continue;
if(dp[i] < node[j].cost) continue;
int t = dp[i] - node[j].cost + node[j].rec;
if(t >= 100) dp[i|(1<<j)] = 100;
else
dp[i|(1<<j)] = max(dp[i|(1<<j)] , t);
}
}
if(dp[(1<<n) - 1] < boss) printf("try again\n");
else printf("clear!!!\n");
}

return 0 ;
}