Pagini recente » Cod sursa (job #168205) | Cod sursa (job #2880675) | Cod sursa (job #1959331) | Cod sursa (job #248141) | Cod sursa (job #2082130)
#include <fstream>
using namespace std;
ifstream in("energii.in");
ofstream out("energii.out");
int n,g[1005],c[1005], dp[5005], W;
int main()
{
in >> n >> W;
for( int i=1; i<=n; i++)
in >> g[i] >> c[i];
for(int i=1; i<=n; i++)
for(int j=W; j>0; j--)
if( g[i]<=j)
{
dp[j] = max(dp[j], dp[j-g[i]]+c[i]);
if( dp[j] >= W ) return out << dp[j],0;
}
return out << -1, 0;
}