Pagini recente » Cod sursa (job #2812111) | Cod sursa (job #2124027) | Cod sursa (job #2782658) | Cod sursa (job #91538) | Cod sursa (job #1127207)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int c[2][10005],w[5005],p[5005],n,G,i,l,j;
void citire(){
f>>n>>G;
for(i=1;i<=n;i++){
f>>w[i]>>p[i];
}
}
void solve(){
l=1;
for(i=1;i<=n;i++,l=1-l){
for(j=1;j<=G;j++)
if(w[i]<=j)
c[l][j]=max(c[1-l][j],c[1-l][j-w[i]]+p[i]);
else
c[l][j]=c[1-l][j];
}
g<<c[1-l][G];
}
int main()
{
citire();
solve();
return 0;
}