Cod sursa(job #918961)
| Utilizator | Data | 19 martie 2013 11:40:57 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
int x[5001],y[5001],l[5001];
int main()
{
int n,i,j,c,tit,tud,op,ap,max;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
f>>n>>op;
for(i=1;i<=n;i++)
{
f>>l[i]>>x[i];
for(j=op;j>=0;j--)
if(y[j]>0&&j+l[i]<=op)
if(x[i]+y[j]>y[j+l[i]])
y[j+l[i]]=x[i]+y[j];
if(y[l[i]]<x[i])
y[l[i]]=x[i];
}
max=0;
for(i=1;i<=op;i++)
if(y[i]>max)
max=y[i];
g<<max;
f.close();
g.close();
return 0;
}
