Cod sursa(job #1579763)
| Utilizator | Data | 25 ianuarie 2016 08:21:16 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
fstream g("rucsac.out");
int d[10005];
struct sp
{
int w,p;
} v[5005];
int main()
{
int n, w, sol=0, j, i;
f>>n>>w;
for(i=1; i<=n; i++)
{
f>>v[i].w>>v[i].p;
}
for(i=1; i<=n; i++)
for(j=w-v[i].w; j>=0; j--)
if(d[v[i].w+j]<d[j]+v[i].p)
{
d[v[i].w+j]=d[j]+v[i].p;
if(d[j+v[i].w]>sol)
sol=d[j+v[i].w];
}
g<<sol<<'\n';
return 0;
}
