Cod sursa(job #2279885)
| Utilizator | Data | 10 noiembrie 2018 10:10:47 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#define GMAX 10005
using namespace std;
int n, g, dp[GMAX];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int max(int a, int b)
{
return ((a > b) ? a : b);
}
int din(int n, int g)
{
int w, p;
for (int i = 1; i <= n; i++)
{
fin >> w >> p;
for (int j = g; j >= w; j--)
dp[j] = max(dp[j], dp[j - w] + p);
}
return dp[g];
}
int main()
{
int n, g;
fin >> n >> g;
fout << din(n, g);
return 0;
}