Cod sursa(job #2749837)
Utilizator | Data | 8 mai 2021 14:50:16 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#define ll long long int
using namespace std;
ll n, W, dp[5001][10001];
int main(){
cin >> n >> W;
for(int i=1; i<=n; i++){
ll w, v;
cin >> w >> v;
for(int j=1; j<=W; j++){
dp[i][j] = dp[i - 1][j];
if(w <= j)
dp[i][j] = max(dp[i][j], dp[i - 1][j - w] + v);
}
}
cout << dp[n][W];
}