Cod sursa(job #2488794)
| Utilizator | Data | 7 noiembrie 2019 17:17:48 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, m;
int dp[10005], a[5005], b[5005];
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
{
cin >> a[i] >> b[i];
}
for(int i = 1; i <= n; i++)
{
for(int j = m; j >= 1; j--)
{
if (a[i] <= j)
dp[j] = max(dp[j], dp[j - a[i]] + b[i]);
}
}
cout << dp[m];
return 0;
}
