Cod sursa(job #3183383)
Utilizator | Data | 11 decembrie 2023 17:39:37 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
int dp[10001];
int main()
{
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
int n, k;
cin>>n>>k;
int g, p;
for(int i=1; i<=n; i++)
{
cin>>g>>p;
for(int j=k-g; j>=0; j--)
dp[j+g]=max(dp[j+g], dp[j]+p);
}
int maxi=0;
for(int i=0; i<=k; i++)
maxi=max(maxi, dp[i]);
cout<<maxi;
return 0;
}