Cod sursa(job #2654521)
Utilizator | Data | 1 octombrie 2020 13:30:41 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, gmax, dp[10005], gc, vc;
int main()
{
f>>n>>gmax;
for (int i=1; i<=n; i++)
{
f>>gc>>vc;
for (int j=gmax; j>=gc; j--)
dp[j] = max(dp[j], dp[j-gc]+vc);
}
g<<dp[gmax];
return 0;
}