51Nod 1085 背包问题

复制代码

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int maxn = 1000000 + 5;
int v[maxn];
int c[maxn];
int dp[maxn];

int main(){
    ios::sync_with_stdio(false);
    int n, w;
    cin >> n >> w;
    for (int i = 1; i <= n; i++){
        cin >> v[i] >> c[i];
    }
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= n; i++){
        for (int j = w; j >= 0; j--){
            if (v[i]<=j)
            dp[j] = max(dp[j], dp[j - v[i]] + c[i]);
        }
    }
    cout << dp[w] << endl;
    return 0;
}