Cod sursa(job #3244272)
| Utilizator | Data | 24 septembrie 2024 13:45:50 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, Pmax;
int w[5010], p[5010];
int dp[10001][10001];
int main()
{
fin>>n>>g;
for(int i=1; i<=n; i++)
fin>>w[i]>>p[i];
for(int i=1; i<=n; i++)
for(int k=0; k<=g; k++)
{
dp[i][k] = dp[i-1][k];
if(w[i]<=k)
dp[i][k] = max(dp[i][k], dp[i - 1][k - w[i]] + p[i]);
}
Pmax = dp[n][g];
fout<<Pmax;
return 0;
}
