Cod sursa(job #1123951)
Utilizator | Data | 26 februarie 2014 10:45:25 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream fi("rucsac.in");
ofstream fo("rucsac.out");
int t[10001], n, g, k, p;
int main() {
fi >> n >> g;
for (int i=1; i<=n; ++i) {
fi >> k >> p;
for (int j=g-k; j>=0; --j)
if (t[j+k] < t[j] + p) t[j+k] = t[j] + p;
}
fo << t[g];
fi.close();
fo.close();
}