Pagini recente » Cod sursa (job #1460608) | Cod sursa (job #998778) | Cod sursa (job #1564221) | Clasamentul arhivei de probleme | Cod sursa (job #2640457)
//#include "pch.h"
#include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("energii.in");
ofstream o("energii.out");
int n, g;
int v[2][10002];
int energy[10001];
int price[10001];
int main()
{
f >> n >> g;
for (size_t i = 1; i <= n; i++)
{
f >> energy[i] >> price[i];
}
int d = 0;
for (size_t i = 1; i <= n; i++)
{
for (size_t j = 1; j <= g; j++)
{
v[1 - d][j] = v[d][j];
if (energy[i] <= j)
{
v[1 - d][j] = max(v[1 - d][j], v[d][j - energy[i]] + price[i]);
}
}
d = 1 - d;
}
o << v[d][g];
}