Cod sursa(job #3258890)
Utilizator | Data | 24 noiembrie 2024 00:07:37 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
#define nMax 5005
#define GMax 10005
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, G;
int w, p;
int dp[GMax];
int main()
{
f >> n >> G;
for(int i=1; i<=n; i++)
{
f >> w >> p;
for(int j=G; j>=w; j--)
{
dp[j] = max(dp[j], dp[j-w] + p);
}
}
g << dp[G];
}