Cod sursa(job #2732431)
| Utilizator | Data | 28 martie 2021 22:53:54 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int DIM = 1e4+5;
int n, g, sol, w[DIM], p[DIM], dp[DIM];
int main()
{
fin >> n >> g;
for(int i=1; i<=n; i++) {
fin >> w[i] >> p[i];
}
for(int i=1; i<=n; i++) {
for(int j=g-w[i]; j>=0; j--) {
if(dp[j+w[i]] < dp[j]+p[i]) {
dp[j+w[i]] = dp[j]+p[i];
sol = max(sol, dp[j+w[i]]);
}
}
}
fout << sol;
return 0;
}
