Cod sursa(job #3223093)
Utilizator | Cuntan Paul P4ulC | Data | 12 aprilie 2024 13:35:17 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
int dp[10001];
struct obiect
{
int gr,profit;
};
obiect ob[5001];
int max(int a,int b)
{
if(a>b)
return a;
return b;
}
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int main()
{
int n,g;
in>>n>>g;
for(int i=1;i<=n;i++)
in>>ob[i].gr>>ob[i].profit;
for(int i=1;i<=n;i++)
{
for(int j=g;j>=0;j--)
if(j>=ob[i].gr)
dp[j]=max(dp[j-ob[i].gr]+ob[i].profit,dp[j]);
}
out<<dp[g];
return 0;
}