Cod sursa(job #1951505)
Utilizator | Data | 3 aprilie 2017 17:49:20 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int DP[10003];
int N,G,W,P;
int main()
{
f>>N>>G;
for(int i=1;i<=N;i++)
{ f>>W>>P;
for(int j=G; j>=W; --j)
DP[j]=max(DP[j],DP[j-W]+P);
}
g<<DP[G];
}