Pagini recente » Cod sursa (job #3001860) | Cod sursa (job #1479173) | Cod sursa (job #260528) | Cod sursa (job #2429622) | Cod sursa (job #1738099)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
long long d[3][10001];
int main()
{
int i,g;
pair<long long,long long>p[5001];
int n,G;
fin>>n>>G;
for(i=1;i<=n;i++)
fin>>p[i].first>>p[i].second;
for(i=1;i<=n;i++)
for(g=G;g>=1;g--)
if(p[i].first<=g)
{
d[1][g]=d[2][g];
d[2][g]=max(d[1][g],d[2][g-p[i].first]+p[i].second);
}
fout<<d[2][G];
return 0;
}