P1855 榨取kkksc03 （多维背包

题目链接

https://www.luogu.org/problemnew/show/P1855

题意：

二维背包的模板， 两个容量 将01背包数组再开一一维记录值就可以了

#include <bits/stdc++.h>
using namespace std;

#define cpp_io() {ios::sync_with_stdio(false); cin.tie(NULL);}
#define rep(i,a,n) for (int i=a;i<n;i++)
#define repp(i,a,n) for (int i=a;i<=n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define CLR(a,b) memset(a,(b),sizeof(a))
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ls o<<1
#define rs o<<1|1


typedef long long ll;
typedef vector<int> VI;
const int MAXN = (int)1e3+10;
const int INF = 0x3f3f3f3f;
const int mod = (int)1e9+7;

void F() {
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif
}

struct node {
    ll a,b,c;
}p[MAXN];
bool cmp(const node &x,const node &y) {
    return x.c*y.b<y.c*x.b;
}

int dp[MAXN][MAXN];

int v[MAXN], vv[MAXN];
int main() {
    cpp_io();
    int n,m,t;cin>>n>>m>>t;
    repp(i,1,n) cin>>v[i]>>vv[i];
    repp(i,1,n) {
        for(int j=m;j>=v[i];--j) {
            for(int k=t;k>=vv[i];--k) {
                dp[j][k]=max(dp[j][k],dp[j-v[i]][k-vv[i]]+1);
            }
        }
    }
    cout<<dp[m][t]<<"\n";
    return 0;
}