Pagini recente » Borderou de evaluare (job #3037725) | Cod sursa (job #2811468) | Cod sursa (job #2378428) | Cod sursa (job #2392237) | Cod sursa (job #3229488)
#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];
}