Pagini recente » Cod sursa (job #850258) | Cod sursa (job #3217663) | Cod sursa (job #2635671) | Cod sursa (job #391150) | Cod sursa (job #1842216)
#include<fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
const int INF = 0x3f3f3f3f;
int n,g,w,p;
int b[10001];
int main(){
in>>n>>g;
for(int i=1;i<=g;i++) b[i]=-INF;
for(int i=1;i<=n;i++){
in>>w>>p;
for(int j=g;j>=0;j--){
if(j+w<=g && b[j]+p > b[j+w]){
b[j+w] = b[j]+p;
}
}
}
int ans=-INF;
for(int i=0;i<=g;i++) ans=max(ans,b[i]);
out<<ans<<'\n';
return 0;
}