Cod sursa(job #3003450)
| Utilizator | Data | 15 martie 2023 18:59:37 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dp[10001];
int main()
{
int n,g_total,g,p,maxx=0;
fin>>n>>g_total;
dp[0]=1;
for(int i=1;i<=n;i++)
{
fin>>g>>p;
for(int j=g_total;j>=0;j--)
if(dp[j])
dp[j+g]=max(dp[j]+p,dp[j+g]);
}
for(int i=1;i<=g_total;i++)
if(dp[i]>maxx)
maxx=dp[i];
fout<<maxx-1;
fin.close();
fout.close();
return 0;
}
