Mai intai trebuie sa te autentifici.
Cod sursa(job #1006038)
Utilizator | Data | 6 octombrie 2013 10:01:53 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,v[100001],w,p,j;
int main()
{
f>>n>>G;
for(int i=1;i<=n;i++)
{
f>>w>>p;
for(j=G;j>=w;j--)
if (v[j]<v[j-w]+p) v[j]=v[j-w]+p;
}
g<<v[G];
f.close ();
g.close ();
return 0;
}