Cod sursa(job #1542998)
| Utilizator | Data | 5 decembrie 2015 21:00:53 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
#define MAXN 5002
#define MAXG 10002
int b[MAXG];
int main()
{
int n, g, i, j, x, w, p;
fin >> n >> g;
for(i = 1 ; i <= n ; i++)
x = 0;
for(i = 1 ; i <= n ; i++)
{
fin >> w >> p;
for(j = g ; j >= 0 ; j--)
if(j >= w)
x = max(x, b[j] = max(b[j], b[j - w] + p));
}
fout << x << "\n";
}
