Pagini recente » Cod sursa (job #1645698) | Cod sursa (job #1182056) | Cod sursa (job #2858082) | Cod sursa (job #2419079) | Cod sursa (job #2010093)
#include <iostream>
#include <fstream>
#include <cstring>
#include <bitset>
#include <algorithm>
using namespace std;
#define MAXN 1010
#define MAXG 10010
ifstream in("energii.in");
ofstream out("energii.out");
int N,G,Pmax;
int W[MAXN],P[MAXN],D[MAXN][MAXG];
int main()
{
in>>N>>G;
for(int i=1;i<=N;i++)
in>>W[i]>>P[i];
for(int i=1;i<=N;i++)
for(int cw=0;cw<=G;cw++)
{
D[i][cw]=D[i-1][cw];
if(W[i]<=cw)
D[i][cw]=max(D[i][cw],D[i-1][cw-W[i]]+P[i]);
}
out<<D[N][G];
}