Cod sursa(job #2927244)
Utilizator | Data | 19 octombrie 2022 20:21:25 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, G, g, p, dp[10005];
int main()
{
fin>>n>>G;
for(int i=1; i<=n; i++)
{
fin>>g>>p;
for(int j=G; j>=g; j--)
dp[j]=max(dp[j], dp[j-g]+p);
}
fout<<dp[G];
fout.close();
return 0;
}