Pagini recente » Cod sursa (job #337860) | Cod sursa (job #2415559) | Cod sursa (job #241053) | Cod sursa (job #1420487) | Cod sursa (job #3031672)
#include <bits/stdc++.h>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n, g, w[5005], p[5005], d[10005], ans;
int main() {
in>>n>>g;
for (int i = 1; i <= n; i++)
in>>w[i]>>p[i];
for (int i = 1; i <= n; i++)
for(int j = g; j >= 0; j--) {
if (j - w[i] >= 0) d[j] = max(d[j], d[j - w[i]] + p[i]);
ans = max(ans, d[j]);
}
out<<ans<<'\n';
}