Cod sursa(job #2795550)
Utilizator | Data | 6 noiembrie 2021 16:07:18 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n, i, dp[1005],j,gmax,x,y;
int main()
{
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
cin >> n >> gmax;
for (i = 1;i <= n;i++)
{
cin >> x >> y;
for (j = gmax;j >= x;j--)
dp[j] = max(dp[j], dp[j - x] + y);
}
cout << dp[gmax];
}