Cod sursa(job #2429495)
Utilizator | Alecs Andru ALEx6430 | Data | 9 iunie 2019 20:00:10 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int main()
{
int n, g;
in >> n >> g;
vector<int> w(n), p(n);
for(int i = 0; i < n; i++)
in >> w[i] >> p[i];
int dp[10000] = {0};
int profit = 0;
for(int i = 0; i < n; i++)
for(int j = g-w[i]; j >= 0; j--)
{
int disponibil = j + w[i];
if(dp[disponibil] < dp[j] + p[i])
{
dp[disponibil] = dp[j] + p[i];
if(dp[disponibil] > profit)
profit = dp[disponibil];
}
}
out << profit;
return 0;
}