Mai intai trebuie sa te autentifici.
Cod sursa(job #1154008)
| Utilizator | Data | 25 martie 2014 21:46:40 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
struct art { int p,w; } A[5009];
int n,G,sol,pd[10009];
int main()
{
f >> n >> G;
for(int i=1; i<=n; i++)
{
f >> A[i].w >> A[i].p;
}
pd[0] = 1;
for(int i=1; i<=n; i++)
{
for(int j=G-A[i].w; j>=0; j--)
{
if(pd[j])
{
pd[j+A[i].w] = pd[j] + A[i].p;
if(pd[j+A[i].w] > sol) sol = pd[j+A[i].w];
}
}
}
g << sol-1 << '\n';
g.close();
return 0;
}
