Cod sursa(job #1646574)
Utilizator | Data | 10 martie 2016 16:42:40 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,greutate,i,a[100005],j,fin,greu,cost;
int main()
{
f>>n>>greutate;
for(i=1;i<=n;i++)
{
f>>greu>>cost;
for(j=greutate;j>=greu;j--)
a[j]=max(a[j],a[j-greu]+cost);
}
for(i=1;i<=greutate;i++)
fin=max(fin,a[i]);
g<<fin;
return 0;
}