Cod sursa(job #1969560)
| Utilizator | Data | 18 aprilie 2017 15:26:08 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f ("rucsac.in");
ofstream g ("rucsac.out");
int usu,n,v1[5003],v2[5003],d[2][10003],t;
int main()
{
f>>n>>usu;
for(int i=1;i<=n;++i) f>>v1[i]>>v2[i];
for(int i=1;i<=n;++i,t=1-t)
{
for(int j=0;j<=usu;++j)
{
d[1-t][j]=d[t][j];
if(v1[i]<=j)
{
d[1-t][j]=max(d[1-t][j],d[t][j-v1[i]]+v2[i]);
}
}
}
g<<d[t][usu];
return 0;
}
