Cod sursa(job #3250132)
| Utilizator | Data | 19 octombrie 2024 12:14:59 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| 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, pack, weight[5002], value[5002] ;
int main()
{
cin >> n >> pack ;
for (int i = 1 ; i <= n ; i ++)
cin >> weight[i] >> value[i] ;
for (int i = 1 ; i <= n ; i ++)
{
for (int j = pack ; j >= weight[i] ; j --)
dp[i] = max (dp[j], dp[j - weight[i]] + value[i]) ;
}
cout << dp[pack] ;
return 0 ;
}
