Pagini recente » Cod sursa (job #1886953) | Cod sursa (job #2681273) | Cod sursa (job #3345037) | Cod sursa (job #3319141) | Cod sursa (job #3355185)
#include <iostream>
#include <vector>
#include <algorithm>
// #include <fstream>
// ifstream fin("rucsac.in");
// ofstream fout("rucsac.out");
using namespace std;
int main() {
int N, G;
cin >> N >> G;
vector<int> dp(G+1, 0);
for(int i = 1; i<=N; i++) {
int W, P;
cin >> W >> P;
for(int g = G; g >= W; g--) {
dp[g] = max(dp[g], dp[g - W] + P);
}
}
cout << dp[G];
return 0;
}