Cod sursa(job #1389764)
| Utilizator | Data | 16 martie 2015 17:10:14 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#define GMAX 10000
#define NMAX 5000
#define max(a,b) a>b?a:b
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int N, G, l;
int w[NMAX+1], p[NMAX+1], W[GMAX+1];
int main() {
fin >> N >> G;
for (int i = 1; i <= N; i++)
fin >> w[i] >> p[i];
for (int i = 1; i <= N; i++, l = inc(l))
for (int wcrt = G; wcrt >= w[i]; wcrt--) {
W[wcrt] = max(W[wcrt], W[wcrt - w[i]] + p[i]);
}
fout << W[G] << endl;
}