Cod sursa(job #3229488)
Utilizator | Data | 16 mai 2024 10:35:52 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int dp[10001];
signed main()
{
int n, g;
cin>>n>>g;
pair<int, int> v[n + 1];
for(int i = 0; i < n; i++)
cin>>v[i].first>>v[i].second;
for(int i = 0; i < n; i++)
{
for(int j = g; j >= v[i].first; j--)
{
dp[j] = max(dp[j], dp[j - v[i].first] + v[i].second);
}
}
cout<<dp[g];
}