Cod sursa(job #2150468)
| Utilizator | Data | 3 martie 2018 16:19:26 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream in ("rucsac.in");
ofstream out ("rucsac.out");
int n,g,Rez[10005],cost[5005],val[5005];
int main()
{
int i,j,sol=0;
in>>n>>g;
for(i=1;i<=n;i++)
in>>cost[i]>>val[i];
for(i=1;i<=n;i++)
for(j=g-cost[i];j>=0;j--)
if(Rez[j+cost[i]]<Rez[j]+val[i])
{
Rez[j+cost[i]]=Rez[j]+val[i];
if(Rez[j+cost[i]]>sol)
sol=Rez[j+cost[i]];
}
out<<sol;
return 0;
}
