Pagini recente » Cod sursa (job #1110880) | Cod sursa (job #2611922) | Cod sursa (job #1842608) | Monitorul de evaluare | Cod sursa (job #2191740)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream go("rucsac.out");
int N,G,g[5001],pret[5001],m[5001][5001];
int main()
{
f>>N>>G;
for(int i=1;i<=N;i++) f>>g[i]>>pret[i];
for(int i=1;i<=N;i++)
for(int j=0;j<=G;j++)
{
m[i][j]=m[i-1][j];
if(g[i]<=j)
m[i][j]=max(m[i][j],pret[i]+m[i-1][j-g[i]]);
}
go<<m[N][G];
return 0;
}