Cod sursa(job #1908031)
Utilizator | Data | 6 martie 2017 22:19:42 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.22 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int N,G,a[10003],W,P,i;int main(){f>>N>>G;while(N--){f>>W>>P;for(i=G;i>0;--i) if(W <= i) a[i] = max(a[i],a[i-W]+P);} g<<a[G];}