Pagini recente » Cod sursa (job #1210006) | Cod sursa (job #2623182) | Diferente pentru problema/euclid intre reviziile 8 si 9 | Cod sursa (job #1763051) | Cod sursa (job #2978090)
#include <bits/stdc++.h>
using namespace std;
ifstream in ("rucsac.in");
ofstream out("rucsac.out");
#define maxG 10000
int v[2][maxG+1];
int main(){
int n,G;
in>>n>>G;
for(int i=1;i<=n;i++){
int g,p;
in>>g>>p;
for(int j=0;j<=G;j++){
v[i&1][j]=v[(i-1)&1][j];
if(g<=j){
v[i&1][j]=max(v[(i-1)&1][j],v[(i-1)&1][j-g]+p);
}
}
}
out<<v[(n&1)][G];
}