Submission #10405744

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int n, w;
long long sol[100010];

int main() {
    cin >> n >> w;

    for (int i = 1; i <= n; i++) {
        int weight, value;
        cin >> weight >> value;

        for (int j = w - weight; j >= 0; j--)
            sol[j + weight] = max(sol[j + weight], sol[j] + value);
    }

    cout << sol[w];
    return 0;
}

Submission Info

Judge Result