Cod sursa(job #1260480)
Utilizator | Data | 11 noiembrie 2014 12:46:56 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
#include<algorithm>
#include<iostream>
#define NMAX 10010
using namespace std;
ifstream f("rucsac.in");
ofstream f1("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);
}
}
f1<<v[G];
return 0;
}