Cod sursa(job #873917)
Utilizator | Antonesi Florean Costin costin7856 | Data | 7 februarie 2013 19:10:49 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
#define dim1 5010
#define dim2 10010
using namespace std;
int n,gr,a[dim1],p[dim1],d[2][dim2];
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
f>>n>>gr;
for(int i=1;i<=n;i++)
f>>a[i]>>p[i];
int l=0;
for(int i=1;i<=n;i++,l=1-l)
for(int j=0;j<=gr;j++)
{
d[1-l][j]=d[l][j];
if(a[i]<=j)
d[1-l][j]=max(d[1-l][j],d[l][j-a[i]]+p[i]);
}
g<<d[l][gr];
}