Cod sursa(job #2797293)
| Utilizator | Data | 9 noiembrie 2021 18:01:11 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <climits>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
long long dp[100009] ;
int main()
{
int n, g ;
cin >> n >> g ;
for(int f = 1, a, b ; f <= n ; f ++)
{
cin >> a >> b ;
for(int e = g ; e >= a ; e --)
dp[e] = max(dp[e - a] + b, dp[e]) ;
}
cout << dp[g] ;
return 0;
}
