Cod sursa(job #1843447)
| Utilizator | Data | 8 ianuarie 2017 18:43:56 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int Nmax=5000+5,Gmax=10000+5;
int N,G;
int W[Nmax],P[Nmax],Optim[Gmax];
int main()
{
int sol=0;
fin>>N>>G;
for(int i=1;i<=N;++i)fin>>W[i]>>P[i];
Optim[0]=0;
for(int i=1;i<=N;++i)
{
for(int j=G-W[i];j>=0;--j)
{
if(Optim[j+W[i]]<Optim[j]+P[i])
{
Optim[j+W[i]]=Optim[j]+P[i];
if(Optim[j+W[i]]>sol)
sol=Optim[j+W[i]];
}
}
}
fout<<sol;
return 0;
}
