Pagini recente » Cod sursa (job #720903) | Cod sursa (job #5782) | Cod sursa (job #1012086) | Cod sursa (job #2872811) | Cod sursa (job #1574488)
#include <fstream>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
const int WMAX = 5005;
const int NMAX = 1005;
const int INF = 1e8;
int N, W;
int P[NMAX], G[NMAX], Sol[WMAX];
int main()
{
fin >> N >> W;
for(int i = 1; i <= N; i++)
fin >> P[i] >> G[i];
for(int i = 1; i <= WMAX; i++)
Sol[i] = INF;
Sol[0] = 0;
for(int i = 1; i <= N; i++)
for(int j = W - 1; j >= 0; j--)
if(Sol[j] != INF) {
if(j + P[i] < W)
Sol[j + P[i]] = min(Sol[j + P[i]], Sol[j] + G[i]);
else
Sol[W] = min(Sol[W], Sol[j] + G[i]);
}
fout << (Sol[W] == INF ? -1 : Sol[W]);
return 0;
}