Pagini recente » Cod sursa (job #642780) | Cod sursa (job #486245) | Cod sursa (job #2072880) | Cod sursa (job #1836086) | Cod sursa (job #3343577)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main(){
int n, g;
fin >> n >> g;
vector<int> w(n), p(n);
for(int i = 0; i < n; i++)
fin >> w[i] >> p[i];
vector<int> dp(g + 1, 0);
for(int i = 0; i < n; i++)
for(int j = g; j >= w[i]; j--)
dp[j] = max(dp[j], dp[j - w[i]] + p[i]);
fout << dp[g] << "\n";
}