Cod sursa(job #1194235)
Utilizator | Data | 3 iunie 2014 10:49:48 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define MAX 10001
int v[MAX], n, g;
int main()
{
int i, p, w, j;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin>>n>>g;
for(i=1; i<=n; i++){
fin>>w>>p;
for(j=g; j>=w; j--)
if(v[j]<v[j-w]+p)
v[j] = v[j-w] + p;
}
fout<<v[g];
return 0;
}