题面:
题目链接:https://codeforces.com/gym/101967/attachments
题面:给一个总容量T,和物品的个数n。给定n个物品 ,每一个物品有两个值,一个是t
代表容量,另外一个p代表权值。只要还存在能拿的物品,就一定要拿,即挑选物品一直到背包装不下为止。求物品最小的权值和。 其中 1<=n,T<=2000
思路
首先想到普通的背包问题的dp思想,然后由于只要能拿的物品,就必须拿,所以用d[i][j]表示前i个物品,容量为j时的最小权值。额外开一个数组,l[i][j]表示前i个物品/.,,容量为j时,在拿到最小权值的前提下,剩余的容量是多少。每个物品按照t由小到大排序(必要;),然后就可以累出状态转移方程了。(详见代码)
AC代码
//#include<bits/stdc++.h>
#include<algorithm>
#include<complex>
#include<iostream>
#include<iomanip>
#include<ostream>
#include<cstring>
#include<string.h>
#include<string>
#include<cstdio>
#include<cctype>
#include<vector>
#include<cmath>
#include<queue>
#include<set>
#include<stack>
#include<map>
#include<cstdlib>
#include<time.h>
#include<ctime>
#include<bitset>
#define pb push_back
#define _fileout freopen("out.txt","w",stdout)
#define _filein freopen("in.txt","r",stdin)
#define ok(i) printf("ok%d\n",i)
using namespace std;
typedef double db;
typedef long long ll;
const double PI = acos(-1.0);
const ll MOD=1e9+7;
const ll NEG=1e9+6;
const int MAXN=2e3+10;
const int INF=0x3f3f3f3f;
const ll ll_INF=9223372036854775807;
const double eps=1e-9;
ll qm(ll a,ll b){ll ret = 1;while(b){if (b&1)ret=ret*a%MOD;a=a*a%MOD;b>>=1;}return ret;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return (a*b)/gcd(a,b);}
int n,T;
struct problem
{
int t,p;
bool operator <(const problem &a)const{
return t<a.t;
}
}a[MAXN];
ll d[MAXN][MAXN];
ll l[MAXN][MAXN];
int main(void)
{
scanf("%d%d",&n,&T);
for(int i=1;i<=n;i++)
{
scanf("%d%d",&a[i].t,&a[i].p);
}
memset(d,INF,sizeof(d));
sort(a+1,a+1+n);
for(int i=0;i<=T;i++)
{
d[0][i]=0;
l[0][i]=i;
}
for(int i=1;i<=n;i++)
{
for(int j=0;j<=T;j++)
{
if(j>=a[i].t){
if(l[i-1][j]>=a[i].t){
d[i][j]=d[i-1][j-a[i].t]+(ll)a[i].p;
l[i][j]=l[i-1][j-a[i].t];
}
else
{
d[i][j]=d[i-1][j];
l[i][j]=l[i-1][j];
if(d[i-1][j-a[i].t]+a[i].p<d[i][j]){
d[i][j]=d[i-1][j-a[i].t]+a[i].p;
l[i][j]=l[i-1][j-a[i].t];
}
}
}
else{
d[i][j]=d[i-1][j];
l[i][j]=l[i-1][j];
}
}
}
printf("%I64d\n",d[n][T]);
return 0;
}