Pagini recente » Cod sursa (job #2682041) | Cod sursa (job #1164771) | Cod sursa (job #1420129) | Cod sursa (job #1599183) | Cod sursa (job #1536702)
/*
NETERMINAT!!!
#include <fstream>
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int n, w, i, j, max1, wmax, s;
int eg[1001], cg[1001];
int a[10001];
int main()
{
f >> n >> w;
wmax = w;
for (i = 1; i <= n; i++)
f >> eg[i] >> cg[i];
for (i = 1; i <= n; i++)
for (j = w; j >= 1; j--)
{
a[j+eg[i]] = max(a[j], a[j]+cg[i]) s += cg[i];
if (s >= w)
for (i = w; i <= 10000; i++)
if (a[i] > max1 && a[i] != 0)
max1 = a[i], wmax = i;
if (max1 == 0)
g << -1;
else
g << max1 << " " << wmax;
return 0;
}