Cod sursa(job #1369100)
Utilizator | Data | 2 martie 2015 21:47:15 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
struct asd{
int gr,pr;
}a[5005];
int N,G;
int d[10005];
int main()
{
f >> N >> G;
for(int i = 1; i <= N; i++){
f >> a[i].gr >> a[i].pr;
}
for(int i = 1; i <= N; i++){
for(int j = G; j >= a[i].gr; j--){
d[j] = max(d[j],d[j - a[i].gr] + a[i].pr);
}
}
g << d[G];
return 0;
}