Cod sursa(job #3002288)
Utilizator | Data | 14 martie 2023 17:13:59 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
const int MAX = 1e4 + 1;
int dp[MAX] , n , g , w , p;
int main(){
cin >> n >> g;
for(int i = 1 ; i <= n ; i++){
cin >> w >> p;
for(int j = g ; j ; j--){
if(j-w >= 0){
dp[j] = max(dp[j],dp[j-w]+p);
}
}
}
cout << dp[g];
return 0;
}