HDU 5887 Herbs Gathering(01背包搜索)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100+10;
typedef long long ll;
ll w[maxn],v[maxn];
ll r[maxn];
ll n,k;
ll ans,t;
int cmp(const int i,const int j) {return (double)v[i]/w[i]>(double)v[j]/w[j];}
bool check(int i,ll sw,ll sv)
{
    for(int j=i;j<k&&sw<t;j++)
    {
        ll idx=r[j];
        if(sw+w[idx]<=t) sw+=w[idx],sv+=v[idx];
        else sv+=(double)v[idx]/w[idx]*(t-sw),sw=t;//最优性剪枝
    }
    return sv>ans;
}
void dfs(int i,ll sw,ll sv)
{
    ans=max(ans,sv);
    if(i<k&&check(i,sw,sv))
    {
        ll idx=r[i];
        if(sw+w[idx]<=t) dfs(i+1,sw+w[idx],sv+v[idx]);
        dfs(i+1,sw,sv);
    }
}
int main()
{
    while(scanf("%lld%lld",&n,&t)!=EOF)
    {
        ans=0;k=0;
        for(int i=0;i<n;i++)
        {
            ll x,y;
            scanf("%lld%lld",&x,&y);
            if(x<=t){
                w[k]=x;v[k]=y;
                r[k]=k;k++;
            }
        }
        sort(r,r+k,cmp);
        dfs(0,0,0);
        printf("%lld\n",ans);
    }
    return 0;
}