Cod sursa(job #2976485)
| Utilizator | Data | 9 februarie 2023 11:40:38 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int greu[5005], profit[5005], dp[10005];
int main(){
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, g, maxx=0;
cin>>n>>g;
for(int i=0; i<n; i++) cin>>greu[i]>>profit[i];
for(int i=0; i<n; i++)
{
for(int j=g-greu[i]; j>=0; j--)
{
if(dp[j]+profit[i]>dp[j+greu[i]])
{
dp[j+greu[i]]=dp[j]+profit[i];
if(dp[j+greu[i]]>maxx) maxx=dp[j+greu[i]];
}
}
}
cout<<maxx;
return 0;
}
