Cod sursa(job #1259006)
Utilizator | Data | 9 noiembrie 2014 17:03:52 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <algorithm>
#include <iostream>
#include <fstream>
#define NMAX 10010
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int v[NMAX];
int main()
{
int N,G,gr,val;
f >> N >> G;
for(int i = 1;i <= N; i++){
f >> gr >> val;
for(int j = G; j >= gr; j--)
{
v[j] = max (v[j],v[j-gr] + val);
}
}
g << v[G];
return 0;
}