Cod sursa(job #2576342)
| Utilizator | Data | 6 martie 2020 18:39:34 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int gmax,n,g,p,dp[5006];
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int main()
{
in>>n>>gmax;
for(int i=1;i<=n;i++)
{
in>>g>>p;
for(int j=gmax;j>=g;j--) dp[j]=max(dp[j],dp[j-g]+p);
}
out<<dp[gmax];
return 0;
}
