C++ 解法, 执行用时: 4ms, 内存消耗: 456KB, 提交时间: 2021-09-11

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    int n,A,B,idx=0;
    cin>>n>>A>>B;
    vector<int> value(n);
    vector<int> weight(n);
    while(n--){
        cin>>weight[idx]>>value[idx];
        idx++;
    }
    n=(int)value.size();
    vector<int> All_A(n,0);
    vector<int> All_B(n,0);
    vector<int> dpA(A+1,0);
    vector<int> dpB(B+1,0);
    for(int i=0;i<n;++i){
        for(int j=A;j>=weight[i];--j)
            dpA[j]=max(dpA[j],dpA[j-weight[i]]+value[i]);
        All_A[i]=dpA[A];
    }
    for(int i=n-1;i>=0;--i){
        for(int j=B;j>=weight[i];--j)
            dpB[j]=max(dpB[j],dpB[j-weight[i]]+value[i]);
        All_B[i]=dpB[B];
    }
    int combination=0;
    for(int i=0;i<n-1;++i)
        combination=max(combination,All_A[i]+All_B[i+1]);
    cout<<combination;
    return 0;
}

C++ 解法, 执行用时: 4ms, 内存消耗: 456KB, 提交时间: 2020-10-29

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

int main(){
    int n,A,B,maxval = 0;
    int bagA[1002],bagB[1002],ansA[1002],ansB[1002],v[1002],w[1002];
    cin >> n >> A >> B;
    for(int i = 1; i <= n ; i++){
        cin >> v[i] >> w[i];
        for(int j = A; j >= v[i]; j--){
            bagA[j] = max(bagA[j], bagA[j - v[i]] + w[i]);
        }
        ansA[i] = bagA[A];
    }
    
    for(int i = n; i >= 1; i--){
        for(int j = B; j >= v[i]; j--){
            bagB[j] = max(bagB[j], bagB[j - v[i]] + w[i]);
        }
        ansB[i] = bagB[B];
    }
    
    for(int i = 0; i <= n; i++){
        maxval = max(ansA[i] + ansB[i + 1], maxval);
    }
    cout << maxval << endl;
    return 0;
}