Cod sursa(job #3005422)
| Utilizator | Data | 16 martie 2023 23:13:00 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n, g;
int dp[100005];
signed main()
{
in >> n >> g;
for(int i = 1; i <= n; i++)
{
int gr, pret;
in >> gr >> pret;
for(int j = g; j >= gr; j--)
dp[j] = max(dp[j], pret + dp[j - gr]);
}
int maxim = 0;
for(int i = 1; i <= g; i++)
{
maxim = max(maxim, dp[i]);
}
out << maxim;
return 0;
}
