Cod sursa(job #2652174)
Utilizator | Data | 24 septembrie 2020 15:22:01 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#define GMAX 10005
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, gm, gr, p;
int a[GMAX];
int main()
{
f>>n>>gm;
for(int i=1; i<=n; i++)
{
f>>gr>>p;
for(int i=gm; i>=gr; i--)
{
a[i]=max(a[i], a[i-gr]+p);
}
}
g<<a[gm];
return 0;
}