Cod sursa(job #3254983)
| Utilizator | Data | 9 noiembrie 2024 11:02:09 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
#define limN 5002
#define limG 10002
int W[limN], P[limN];
int dp[2][limG];
int main()
{
int n, gmax;
fin>>n>>gmax;
for(int i = 1; i <= n; i++) {
fin>>W[i]>>P[i];
}
for(int i = 1; i <= n; i++) {
for(int j = 0; j <= gmax; j++) {
dp[i%2][j] = dp[(i-1)%2][j];
if(W[i] <= j)
dp[i%2][j] = max(dp[i%2][j], dp[(i-1)%2][j-W[i]]+P[i]);
}
}
fout<<dp[n%2][gmax];
return 0;
}