Cod sursa(job #2569533)
Utilizator | Data | 4 martie 2020 12:29:54 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int n, gmax, g[5005], v[5005], rez[10005];
int main()
{
int i, j;
fin>>n>>gmax;
for (i=1; i<=n; i++)
{
fin>>g[i]>>v[i];
}
for (i=1; i<=n; i++)
{
for (j=gmax; j>=g[i]; j--)
{
if (v[i]+rez[j-g[i]]>rez[j])
{
rez[j]=v[i]+rez[j-g[i]];
}
}
}
fout<<rez[gmax];
fin.close();
fout.close();
return 0;
}