Cod sursa(job #3245502)
| Utilizator | Data | 29 septembrie 2024 10:58:20 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int NMAX=5005;
const int MAXG=10005;
int w[NMAX], p[NMAX];
int dp[MAXG];
int main()
{
int n, GMAX, REZ;
fin >> n >> GMAX;
for(int i = 1; i <= n; ++i){
fin >> w[i] >> p[i];
}
for(int i = 1; i <= GMAX; ++i){
dp[i] = -1;
}
REZ = 0;
for(int i = 1; i <= n; ++i){
for(int j = GMAX; j >= w[i]; --j){
dp[j]=max(dp[j], dp[j-w[i]] + p[i]);
REZ=max(REZ, dp[j]);
}
}
fout << REZ;
return 0;
}
