Cod sursa(job #1786515)
Utilizator | Data | 23 octombrie 2016 09:32:24 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n,G,i,j,d[100000]={},p,w;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
fin>>n>>G;
for(i=1;i<=n;++i)
{
fin>>w>>p;
for(j=G;j>=w;--j)
{
d[j]=max(d[j],d[j-w]+p);
}
}
fout<<d[G];
}