Cod sursa(job #2576788)
Utilizator | blaugranadevil lucian2015 | Data | 6 martie 2020 22:52:57 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <algorithm>
#define nmax 5002
#define gmax 10001
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int dp[gmax + 1] , weight[nmax + 1] , profit[nmax + 1];
int main(){
int N, G;
f >> N >> G;
for(int i = 0; i < N; i++){
f >> weight[i] >> profit[i];
}
for( int i = 0; i < N; i++){
for( int j = G; j >= 0; j--)
if( j >= weight[i]){
dp[j] = max(dp[j], dp[j - weight[i]] + profit[i]);
}
}
g << dp[G] <<"\n";
}