Pagini recente » Cod sursa (job #1942687) | Cod sursa (job #1427467) | Cod sursa (job #2124767) | Cod sursa (job #2415633) | Cod sursa (job #1521579)
#include<fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
inline int max(int a,int b)
{
if(a>b)
return a;
return b;
}
int n,g,p,w,a[2][100010],l;
int main()
{
in>>n>>g;
for(int i=1;i<=n;i++)
{
in>>w>>p;
for(int j=1;j<=g;j++)
if(j<w)
a[1-l][j]=a[l][j];
else a[1-l][j]=max(a[l][j],a[l][j-w]+p);
l=1-l;
}
out<<a[n][g]<<'\n';
out.close();
return 0;
}