题意:
n个物品,时间限制m;
给出每个物品的价值和时间;
求在m限制内,最多的价值。
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200;
typedef long long ll;
struct Node
{
ll x,y;
bool operator < (const Node & a)//性价比排序
{
return (y + 0.0) / x > (a.y + 0.0)/ a.x;
}
}node[maxn];
ll n,m,ans;
void solve(int cur,ll left,ll val)
{
if(left < 0) return;
ans = max(ans,val);
if(cur >= n) return;
if(left * ((node[cur + 1].y + 0.0) / node[cur + 1].x) + val < ans) return;//剪枝
for(int i = cur + 1;i <= n ;i++)
solve(i,left - node[i].x, val + node[i].y);
}
int main()
{
while(~scanf("%lld%lld",&n,&m))
{
int cnt = 0;
ll x,y;
for(int i = 1; i <= n; i++)
{
scanf("%lld%lld",&x,&y);
if(x > m) continue;
node[++cnt].x = x;
node[cnt].y = y;
}
n = cnt; ans = 0;
sort(node+1,node+n+1);//搜索
solve(0,m,0);
printf("%lld\n",ans);
}
return 0;
}