Cod sursa(job #1207699)
| Utilizator | Data | 13 iulie 2014 17:24:50 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
unsigned greutate[5001],profit[5000],optim[10001];
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int i,j,N,G;
f>>N>>G;
for(i=1;i<=N;i++)
f>>greutate[i]>>profit[i];
for(i=1;i<=N;i++)
for(j=G-greutate[i];j>=0;j--)
if(optim[j+greutate[i]]<optim[j]+profit[i])
optim[j+greutate[i]]=optim[j]+profit[i];
g<<optim[G];
return 0;
}
