Cod sursa(job #2245728)
Utilizator | Data | 25 septembrie 2018 19:24:01 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
const int N = 10010;
int n,w[N],p[N],dp[N],pp;
int main()
{ f>>n>>pp;
for (int i=1;i<=n;i++) f>>w[i]>>p[i];
for (int i=1;i<=n;i++)
for (int j=pp;j>=w[i];j--) dp[j] = max(dp[j], dp[j-w[i]] + p[i]);
g<<dp[pp];
g.close();
return 0;
}