Cod sursa(job #2191759)
Utilizator | Data | 3 aprilie 2018 17:24:13 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include<algorithm>
using namespace std;
int r[11005];
int main() {
int n, g;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin >> n >> g;
for(int i = 1,w,p;i <= n;i++) {
fin >> w >> p;
for(int j = g;j >= 0;j--)
r[j + w] = max(r[j + w], r[j] + p);
}
for(int i = 0;i <= g;i++)
ans = max(ans, r[i]);
fout << ans;
return 0;
}