Cod sursa(job #1004214)
Utilizator | Data | 2 octombrie 2013 12:11:06 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("rucsac.in");
ofstream g ("rucsac.out");
int n,GMAX;
int v[10005];
int main ()
{
int val,G,i,j;
f>>n>>GMAX;
for (i=1;i<=n;i++)
{
f>>G>>val;
for(j=GMAX;j>=G;j--)
{
if (v[j]<v[j-G]+val) v[j]=v[j-G]+val;
}
}
g<<v[GMAX];
return 0;
}