Pagini recente » Cod sursa (job #343991) | Cod sursa (job #3290034) | Cod sursa (job #2801103) | Cod sursa (job #546422) | Cod sursa (job #3002291)
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
const int MAX = 1e4 + 1;
int dp[MAX] , n , g , w , p, maxim;
int main(){
cin >> n >> g;
for(int i = 1 ; i <= g ; i++){
dp[i] = -1;
}
for(int i = 1 ; i <= n ; i++){
cin >> w >> p;
for(int j = g ; j ; j--){
if(j-w >= 0 && dp[j-w]!=(-1)){
dp[j] = max(dp[j],dp[j-w]+p);
}
}
}
for(int i = 1 ; i <= g ; i++){
maxim = max(maxim,dp[i]);
}
cout << maxim;
return 0;
}