Cod sursa(job #3288198)
| Utilizator | Data | 20 martie 2025 20:38:19 | |
|---|---|---|---|
| Problema | Energii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int NMAX = 5e3 + 5, GMAX = 1e4 + 5, INF = 1e10 + 7;
int n, k, dp[GMAX];
pair<int, int> v[NMAX];
int32_t main()
{
freopen("energii.in", "r", stdin);
freopen("energii.out", "w", stdout);
cin >> n >> k;
for(int i = 1; i <= n; i++)
cin >> v[i].first >> v[i].second;
dp[k] = -1;
for(int i = 1; i <= n; i++)
{
for(int j = k; j >= v[i].first; j--)
{
dp[j] = max(dp[j], dp[j - v[i].first] + v[i].second);
}
}
cout << dp[k];
}