Cod sursa(job #2467913)
Utilizator | Data | 5 octombrie 2019 10:44:54 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
long long n, pd[10005], p[5005], w[5005], ma;
int main()
{
f >> n >> ma;
for(int i = 1; i <= n; ++i)
f >> p[i] >> w[i];
for(int i = 1; i <= n; ++i)
for(int j = ma - w[i]; j >= 0; --j)
pd[j + w[i]] = max(pd[j + w[i]], pd[j] + p[i]);
g << pd[ma];
f.close();
g.close();
return 0;
}