Cod sursa(job #2196041)
Utilizator | Data | 18 aprilie 2018 10:04:44 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
const int N = 5010;
int n, w[N], p[N], dp[N], g;
int main(){
ifstream cin ("rucsac.in");
ofstream cout ("rucsac.out");
cin >> n >> g;
for (int i=1; i<=n; i++) cin >> w[i] >> p[i];
for (int i=1; i<=n; i++)
for (int j=g; j>=w[i]; j--) dp[j] = max(dp[j], dp[j-w[i]] + p[i]);
cout << dp[g];
return 0;
}