Cod sursa(job #1787501)
Utilizator | Data | 24 octombrie 2016 19:17:30 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
int n,G,i,j,d[100000]={},p,w;
int main()
{
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
f>>n>>G;
for(i=1;i<=n;++i)
{
f>>w>>p;
for(j=G;j>=w;--j)
{
d[j]=max(d[j],d[j-w]+p);
}
}
g<<d[G]<<'\n';
f.close(); g.close();
return 0;
}