Pagini recente » Cod sursa (job #1404744) | Cod sursa (job #386931) | Cod sursa (job #2004936) | Solutii preONI 2006 - Runda a 2-a | Cod sursa (job #744746)
Cod sursa(job #744746)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int a[3][10001];
int main ()
{
ifstream f("in");
ofstream h("out");
int i,j,G,n,p,g,mat=2;
f>>n>>G;
for(i=1;i<=n;++i)
{
f>>g>>p;
for(j=1;j<=G;++j)
{
a[3-mat][j]=a[mat][j];
if(j>=g)
a[3-mat][j]=max(a[3-mat][j],a[mat][j-g]+p);
}
mat=3-mat;
}
h<<a[mat][G]<<"\n";
f.close();
h.close();
return 0;
}