Cod sursa(job #1110613)
Utilizator | Data | 18 februarie 2014 11:34:33 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int N,G,p[20000],w[20000],s[20000];
int main()
{
ifstream f("rucsac.in");
ofstream g("rucsac.out");
f>>N;
f>>G;
int i,j;
for (i=1;i<=N;i++)
{
f>>w[i]>>p[i];
}
for (i=1;i<=N;i++)
{
for (j=G;j>=w[i];j--)
{
if (s[j]<p[i]+s[j-w[i]])
{
s[j]=p[i]+s[j-w[i]];
}
}
}
g<<s[G];
}